Collapsible graphs and Hamilton cycles of line graphs
From MaRDI portal
Publication:494432
DOI10.1016/j.dam.2015.05.030zbMath1319.05111OpenAlexW2201047783MaRDI QIDQ494432
Publication date: 1 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.030
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on collapsible graphs and super-Eulerian graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- Collapsible graphs and Hamiltonicity of line graphs
- Contractions of graphs with no spanning Eulerian subgraphs
- Spanning Eulerian subgraphs and matchings
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- On hamiltonian line graphs
- A reduction method to find spanning Eulerian subgraphs
- Spanning trails
- Hamiltonian line graphs
- Collapsible graphs and matchings
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: Collapsible graphs and Hamilton cycles of line graphs