Hamilton cycles and closed trails in iterated line graphs
From MaRDI portal
Publication:5752605
DOI10.1002/jgt.3190140308zbMath0721.05044OpenAlexW2067939157MaRDI QIDQ5752605
No author found.
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140308
Related Items (18)
Even factors with a bounded number of components in iterated line graphs ⋮ The Hamiltonian index of a graph and its branch-bonds ⋮ On Computing the Hamiltonian Index of Graphs ⋮ A simple upper bound for the hamiltonian index of a graph ⋮ Forbidden subgraphs on Hamiltonian index ⋮ On the hamiltonian index and the radius of a graph ⋮ Asymptotically sharpening the $s$-Hamiltonian index bound ⋮ 2-factors with the bounded number of components in line graphs ⋮ On computing the Hamiltonian index of graphs ⋮ Unnamed Item ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Panconnected index of graphs ⋮ Minimum number of components of 2-factors in iterated line graphs ⋮ The hamiltonian index of a 2-connected graph ⋮ Degree sum conditions for Hamiltonian index ⋮ Collapsible graphs and reductions of line graphs ⋮ Hamilton-connected indices of graphs ⋮ Closure, stability and iterated line graphs with a 2-factor
Cites Work
This page was built for publication: Hamilton cycles and closed trails in iterated line graphs
