On n-hamiltonian line graphs

DOI10.1016/0095-8956(77)90071-5zbMath0307.05122OpenAlexW1967817720MaRDI QIDQ1217716

Linda Lesniak

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90071-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Every connected, locally connected nontrivial graph with no induced claw is hamiltonian ⋮ An \(s\)-Hamiltonian line graph problem ⋮ Edge-connectivity and edge-disjoint spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• On Spanning and Dominating Circuits in Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On Hamiltonian Line-Graphs

This page was built for publication: On n-hamiltonian line graphs