Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs

DOI10.1002/jgt.10094zbMath1018.05059OpenAlexW4229862769MaRDI QIDQ4805225

Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Jinzhong Mao, Deying Li

Publication date: 11 May 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10094

zbMATH Keywords

Petersen graphEulerian subgraphsHamiltonian line graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (16)

Circumferences of 3-connected claw-free graphs ⋮ Circumferences of 3-connected claw-free graphs. II. ⋮ Hamiltonian line graphs with local degree conditions ⋮ A twelve vertex theorem for 3-connected claw-free graphs ⋮ Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Circumferences of 2-factors in claw-free graphs ⋮ Parameterized edge Hamiltonicity ⋮ Hamiltonian claw-free graphs involving minimum degrees ⋮ Hamiltonicity of claw-free graphs and Fan-type conditions ⋮ Lai's conditions for spanning and dominating closed trails ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ Supereulerian graphs and the Petersen graph ⋮ Circumferences and minimum degrees in 3-connected claw-free graphs ⋮ Spanning trails in a 2-connected graph ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

This page was built for publication: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs