The Hamiltonian index of graphs

DOI10.1016/j.disc.2007.12.105zbMath1175.05077OpenAlexW2053888237MaRDI QIDQ998526

Zhi-Sui Tao, Yi Hong, Zhi-Hong Chen, Jian-Liang Lin

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=1143&context=facsch_papers

zbMATH Keywords

line graphcollapsible graphHamiltonian indexspanning Eulerian subgraph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

On Computing the Hamiltonian Index of Graphs ⋮ Hamiltonian index of directed multigraph ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Hamiltonian index is NP-complete ⋮ On computing the Hamiltonian index of graphs ⋮ Panconnected index of graphs ⋮ The Wiener index in iterated line graphs ⋮ On the extended Clark-Wormold Hamiltonian-like index problem

Cites Work

• Unnamed Item
• Unnamed Item
• On the Hamiltonian index
• On line graphs and the Hamiltonian index
• On the hamiltonian index of a graph
• A reduction method to find spanning Eulerian subgraphs
• 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: The Hamiltonian index of graphs