A result on Hamiltonian line graphs involving restrictions on induced subgraphs

DOI10.1002/jgt.3190120312zbMath0651.05049OpenAlexW2156703585MaRDI QIDQ3795703

Henk Jan Veldman

Publication date: 1988

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

Full work available at URL: https://research.utwente.nl/en/publications/a-result-on-hamiltonian-line-graphs-involving-restrictions-on-induced-subgraphs(2ee6a02f-cbf1-441a-ad4b-29cc2909a187).html

zbMATH Keywords

induced subgraphsHamiltonian line graphs

Mathematics Subject Classification ID

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

Related Items (11)

Pancyclic zero divisor graph over the ring ℤn[i] ⋮ Edge-diameter of a graph and its longest cycles ⋮ 2-factors with the bounded number of components in line graphs ⋮ A lower bound on the Hamiltonian path completion number of a line graph ⋮ A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. ⋮ On the line graph of a graph with diameter 2 ⋮ On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\) ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs ⋮ The hamiltonian index of a 2-connected graph ⋮ Collapsible graphs and reductions of line graphs ⋮ A linear algorithm for the Hamiltonian completion number of the line graph of a tree

Cites Work

• Unnamed Item
• On Spanning and Dominating Circuits in Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: A result on Hamiltonian line graphs involving restrictions on induced subgraphs