On traceable iterated line graph and Hamiltonian path index
From MaRDI portal
Publication:6576546
Recommendations
Cites work
- scientific article; zbMATH DE number 3851144 (Why is no real title available?)
- scientific article; zbMATH DE number 3438910 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
- A simple upper bound for the hamiltonian index of a graph
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Graph theory with applications
- Hamilton-connected indices of graphs
- Hamiltonian index is NP-complete
- Hamiltonian iterated line graphs
- Hamiltonian paths in spanning subgraphs of line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Hamiltonian Line-Graphs
- On \(s\)-fully cycle extendable line graphs
- On distance local connectivity and the Hamiltonian index
- On the Hamiltonian index
- Panconnected index of graphs
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- The Hamiltonian index of graphs
- The \(s\)-Hamiltonian index
- Traceability of line graphs
- \(s\)-vertex pancyclic index
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)
