Ons-Hamiltonian Line Graphs
From MaRDI portal
Publication:2862549
DOI10.1002/jgt.21713zbMath1276.05100OpenAlexW1548387543WikidataQ59713358 ScholiaQ59713358MaRDI QIDQ2862549
Publication date: 15 November 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21713
Hamiltonian graphline graphcollapsible graphdominating Eulerian subgraph\(s\)-Hamiltonian graphspanning Eulerian subgraphessential edge-connectivity\(\tau \)-reduction\(c\)-reduction
Related Items (5)
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 ⋮ A condition on Hamilton-connected line graphs
Cites Work
- Unnamed Item
- On hamiltonian line graphs and connectivity
- Graphs without spanning closed trails
- Duality in graph families
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Decomposition of Finite Graphs Into Forests
This page was built for publication: Ons-Hamiltonian Line Graphs
