On traceable iterated line graph and Hamiltonian path index

DOI10.1007/S11766-024-3905-2MaRDI QIDQ6576546FDOQ6576546

Authors: Zhaohong Niu, Liming Xiong, Weihua Yang 

Publication date: 22 July 2024

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

zbMATH Keywords

traceableiterated line graphHamiltonian indexHamiltonian path index

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory with applications
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian paths in spanning subgraphs of line graphs
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Traceability of line graphs
• Hamiltonian iterated line graphs
• Hamiltonian index is NP-complete
• Hamilton-connected indices of graphs
• Title not available (Why is that?)
• On Hamiltonian Line-Graphs
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• On the Hamiltonian index
• A simple upper bound for the hamiltonian index of a graph
• \(s\)-vertex pancyclic index
• Panconnected index of graphs
• The \(s\)-Hamiltonian index
• The Hamiltonian index of graphs
• On distance local connectivity and the Hamiltonian index
• Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
• Title not available (Why is that?)
• A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path

This page was built for publication: On traceable iterated line graph and Hamiltonian path index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576546)