On traceable line graphs
From MaRDI portal
Publication:489359
DOI10.1007/S00373-013-1371-3zbMath1306.05207OpenAlexW2086759748MaRDI QIDQ489359
Publication date: 20 January 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1371-3
Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Traceability of line graphs
- On dominating and spanning circuits in graphs
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- On hamiltonian line graphs
- On circuits and pancyclic line graphs
- A reduction method to find spanning Eulerian subgraphs
- Hamiltonian line graphs
- Supereulerian graphs: A survey
- On Eulerian and Hamiltonian Graphs and Line Graphs
This page was built for publication: On traceable line graphs