A twelve vertex theorem for 3-connected claw-free graphs
From MaRDI portal
Publication:292255
DOI10.1007/s00373-015-1608-4zbMath1338.05147OpenAlexW833127892MaRDI QIDQ292255
Publication date: 13 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1608-4
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cycle traversability for claw-free graphs and polyhedral maps, Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
Cites Work
- Unnamed Item
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- The \(*\)-closure for graphs and claw-free graphs
- A look at cycles containing specified elements of a graph
- A nine point theorem for 3-connected graphs
- On a closure concept in claw-free graphs
- Cycles through 23 vertices in 3-connected cubic planar graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Cycles through ten vertices in 3-connected cubic graphs
- Cycles containing 12 vertices in 3-connected cubic graphs
- A nine vertex theorem for 3-connected claw- free graphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
