Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
From MaRDI portal
Publication:2888878
DOI10.1002/jgt.20599zbMath1242.05154OpenAlexW2164820426MaRDI QIDQ2888878
Publication date: 4 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20599
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- On a closure concept in claw-free graphs
- Hamiltonian results inK1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: Maximal K3's and Hamiltonicity of 4-connected claw-free graphs