Contractions and hamiltonian line graphs

DOI10.1002/jgt.3190120103zbMath0655.05046OpenAlexW2114380191MaRDI QIDQ3801588

Hon-Jian Lai

Publication date: 1988

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

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

zbMATH Keywords

Eulerian subgraphtriangle-free graphcontraction methodHamiltonian line graph2-edge connected graph

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ Supereulerian graphs, independent sets, and degree-sum conditions ⋮ Supereulerian regular matroids without small cocircuits ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs ⋮ On (s,t)-supereulerian graphs in locally highly connected graphs ⋮ Duality in graph families ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) ⋮ Catlin’s reduced graphs with small orders

Cites Work

• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item

This page was built for publication: Contractions and hamiltonian line graphs