Spanning trails in a 2-connected graph
From MaRDI portal
Publication:2325757
zbMath1420.05089MaRDI QIDQ2325757
Publication date: 30 September 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p56
Related Items
Degree sums of adjacent vertices for traceability of claw-free graphs, On sufficient degree conditions for traceability of claw-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Hamilton cycles in 5-connected line graphs
- Spanning trails containing given edges
- Traceability of line graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- On a closure concept in claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Spanning trails connecting given edges
- On sufficient degree conditions for traceability of claw-free graphs
- A note on Hamiltonian circuits
- Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Spanning trails
- A Note on Sub-Eulerian Graphs
- Spanning 2‐trails from degree sum conditions
- Closure and stable Hamiltonian properties in claw-free graphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On traceability and 2-factors in claw-free graphs
- Degree sums of adjacent vertices for traceability of claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
