3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
From MaRDI portal
Recommendations
Cited in
(20)- Hamiltonicity in claw-free graphs
- Panconnectivity of locally connected claw-free graphs
- Claw-free graphs---a survey
- s-vertex pancyclic index
- On the s-hamiltonianicity of an hourglass-free line graph
- On s-Hamiltonicity of net-free line graphs
- On the line graph of a graph with diameter 2
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Constructing the nearly shortest path in crossed cubes
- Group connectivity and group colorings of graphs --- a survey
- Path extendability of claw-free graphs
- Polynomially determining spanning connectivity of locally connected line graphs
- On s-Hamiltonian line graphs
- scientific article; zbMATH DE number 3851144 (Why is no real title available?)
- Supereulerian graphs: A survey
- Panconnected index of graphs
- Hamiltonian connectedness in claw-free graphs
- Asymptotically sharpening the s-Hamiltonian index bound
- \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs
- An s-Hamiltonian line graph problem
This page was built for publication: 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3803150)