On Hamiltonian Line-Graphs
From MaRDI portal
Cited in
(37)- On the Hamiltonian index
- On line graphs and the Hamiltonian index
- A graph‐theoretic generalization of the clique concept
- The Hamiltonian index of a graph and its branch-bonds
- On the connectedness of 3-line graphs
- A simple upper bound for the hamiltonian index of a graph
- On the 2-factor index of a graph
- On the dominating (induced) cycles of iterated line graphs
- On computing the Hamiltonian index of graphs
- Edge degree conditions for Hamiltonian 2-iterated line graphs
- On traceable iterated line graph and Hamiltonian path index
- The hamiltonian index of a 2-connected graph
- Sufficient conditions for a graph to be Hamiltonian
- k-ordered hamiltonicity of iterated line graphs
- On n-hamiltonian line graphs
- Hamiltonicity of 3-arc graphs
- Hamiltonian index of directed multigraph
- Hamiltonian index is NP-complete
- On the hamiltonian index and the radius of a graph
- Limits of iterated \(H\)-line graphs
- On line graphs of subcubic triangle-free graphs
- On Computing the Hamiltonian Index of Graphs
- Convergence of sequences of iterated triangular line graphs
- On n-distant Hamiltonian line graphs
- Degree sum conditions for Hamiltonian index
- Forbidden subgraphs on Hamiltonian index
- Convergent sequences of iterated \(H\)-line graphs
- Reconstructing a graph from its arc incidence graph
- On distance local connectivity and the Hamiltonian index
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- Hamilton-connected indices of graphs
- Panconnected index of graphs
- Asymptotically sharpening the s-Hamiltonian index bound
- On k-path Hamiltonian graphs and line-graphs
- The Hamiltonian index of graphs
- On n-distant Hamiltonian line graphs
- Index of parameters of iterated line graphs
This page was built for publication: On Hamiltonian Line-Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5557024)
