Recommendations
Cites work
- s-vertex pancyclic index
- A simple upper bound for the hamiltonian index of a graph
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Graph theory
- Hamilton cycles and closed trails in iterated line graphs
- Hamilton-connected indices of graphs
- Hamiltonian connectedness in 3-connected line graphs
- Hamiltonian index is NP-complete
- scientific article; zbMATH DE number 3851144 (Why is no real title available?)
- scientific article; zbMATH DE number 5184446 (Why is no real title available?)
- scientific article; zbMATH DE number 3438910 (Why is no real title available?)
- On Hamiltonian Line-Graphs
- On line graphs and the Hamiltonian index
- On the Hamiltonian index
- On the hamiltonian index of a graph
- Spanning 3-connected index of graphs
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- The \(s\)-Hamiltonian index
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- The hamiltonian index of a graph
- The Hamiltonian index of graphs
Cited in
(6)- On the extended Clark-Wormold Hamiltonian-like index problem
- Johnson graphs are panconnected
- Polynomially determining spanning connectivity of locally connected line graphs
- scientific article; zbMATH DE number 4065031 (Why is no real title available?)
- On s-fully cycle extendable line graphs
- On traceable iterated line graph and Hamiltonian path index
This page was built for publication: Panconnected index of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512606)