Name
Abstract | ||
|---|---|---|
We introduce a closure concept for 2-factors in claw-free graphs that generalizes the closure introduced by the first author. The 2-factor closure of a graph is uniquely determined and the closure operation turns a claw-free graph into the line graph of a graph containing no cycles of length at most 5 and no cycles of length 6 satisfying a certain condition. A graph has a 2-factor if and only if its closure has a 2-factor; however, the closure operation preserves neither the minimum number of components of a 2-factor nor the hamiltonicity or nonhamiltonicity of a graph. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.02.004 | Discrete Mathematics |
Keywords | Field | DocType |
2-factor,closure,claw-free graph,dominating system,line graph,closure operator,claw free graph,satisfiability | Block graph,Discrete mathematics,Combinatorics,Line graph,Vertex-transitive graph,Cubic graph,Null graph,Symmetric graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
310 | 10-11 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.44 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zdeněk Ryjáček | 1 | 434 | 38.43 |
| Liming Xiong | 2 | 109 | 16.30 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |