On the line graph of a graph with diameter 2
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 4043880 (Why is no real title available?)
- scientific article; zbMATH DE number 4055653 (Why is no real title available?)
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- A result on Hamiltonian line graphs involving restrictions on induced subgraphs
- An s-Hamiltonian line graph problem
- Graph theory
- Graphs without spanning closed trails
- Hamilton cycles in 5-connected line graphs
- Hamiltonian results inK1,3-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On \(s\)-Hamiltonian line graphs
- On \(s\)-Hamiltonian-connected line graphs
- On a closure concept in claw-free graphs
- On hamiltonian line graphs and connectivity
- Properties of almost all graphs and complexes
- Reduced graphs of diameter two
- Reflections on graph theory
Cited in
(4)
This page was built for publication: On the line graph of a graph with diameter 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219967)