Eulerian subgraphs and Hamilton-connected line graphs
From MaRDI portal
Publication:1765520
DOI10.1016/j.dam.2004.04.005zbMath1057.05053OpenAlexW2144331024MaRDI QIDQ1765520
Dengxin Li, Mingquan Zhan, Hong-Jian Lai
Publication date: 23 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.04.005
Related Items (46)
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected ⋮ Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected ⋮ A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ Degree sums of adjacent vertices for traceability of claw-free graphs ⋮ Thomassen's conjecture for line graphs of 3-hypergraphs ⋮ On extremal \(k\)-supereulerian graphs ⋮ Group connectivity in 3-edge-connected graphs ⋮ On sufficient degree conditions for traceability of claw-free graphs ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Hamilton‐connected {claw,net}‐free graphs, II ⋮ The Hamiltonicity of essentially 9‐connected line graphs ⋮ Hamilton-connected claw-free graphs with Ore-degree conditions ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Traceability on 2-connected line graphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ Closure and Hamilton-connected claw-free hourglass-free graphs ⋮ Graphs with a 3-cycle-2-cover ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs ⋮ Spanning Eulerian subgraphs of 2-edge-connected graphs ⋮ On computing the Hamiltonian index of graphs ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ On \(s\)-Hamiltonian-connected line graphs ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Multigraphic degree sequences and Hamiltonian-connected line graphs ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Hamiltonicity of 3-arc graphs ⋮ On the independence number of traceable 2-connected claw-free graphs ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ Spanning trails in a 2-connected graph ⋮ The supereulerian graphs in the graph family \(C(l,k)\) ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Catlin’s reduced graphs with small orders ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs ⋮ A condition on Hamilton-connected line graphs
Cites Work
- Graphs without spanning closed trails
- A note on minimum degree conditions for supereulerian graphs
- A reduction method to find spanning Eulerian subgraphs
- A Note on Sub-Eulerian Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Eulerian subgraphs and Hamilton-connected line graphs
