Loading...
  1. Simple search
  2. Search result
Search for: equimatchable-graph
0.006 seconds
Total 1 records

      Equimatchable claw-free graphs

      , Article Discrete Mathematics ; Volume 341, Issue 10 , 2018 , Pages 2859-2871 ; 0012365X (ISSN) Akbari, S ; Alizadeh, H ; Ekim, T ; Gözüpek, D ; Shalom, M ; Sharif University of Technology
      Elsevier B.V  2018
      Abstract
      A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm. © 2018 Elsevier B.V  
    Total 1 records