Graphs without spanning closed trails
From MaRDI portal
Publication:1126285
DOI10.1016/S0012-365X(95)00149-QzbMath0859.05060MaRDI QIDQ1126285
Hong-Jian Lai, Paul A. Catlin, Zheng-Yiao Han
Publication date: 7 April 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (max. 100)
Circumferences of 3-connected claw-free graphs ⋮ Circumferences of 3-connected claw-free graphs. II. ⋮ Hamiltonian line graphs with local degree conditions ⋮ Spanning trails with variations of Chvátal-Erdős conditions ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ On spanning disjoint paths in line graphs ⋮ Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs ⋮ Strengthened Ore conditions for \((s, t)\)-supereulerian 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 ⋮ Supereulerian width of dense graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ Hamiltonicity of 6-connected line 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 ⋮ Group connectivity under 3‐edge‐connectivity ⋮ Hamilton-connected claw-free graphs with Ore-degree conditions ⋮ Supereulerian regular matroids without small cocircuits ⋮ On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs ⋮ Traceability on 2-connected line graphs ⋮ Fan-type conditions for spanning Eulerian subgraphs ⋮ Graphs with a 3-cycle-2-cover ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Spanning Eulerian subgraphs of 2-edge-connected graphs ⋮ Collapsible graphs and Hamiltonian connectedness of line graphs ⋮ Degree sum and Hamiltonian-connected line graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ Spanning cycles in regular matroids without small cocircuits ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs ⋮ On the line graph of a graph with diameter 2 ⋮ Supereulerian graphs and matchings ⋮ On \(( s , t )\)-supereulerian graphs with linear degree bounds ⋮ Hamiltonicity of claw-free graphs and Fan-type conditions ⋮ On 3-edge-connected supereulerian graphs ⋮ How many conjectures can you stand? A survey ⋮ Polynomially determine if a graph is \((s,3)\)-supereulerian ⋮ On \(s\)-Hamiltonian-connected line graphs ⋮ Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors ⋮ Collapsible subgraphs of a 4-edge-connected graph ⋮ Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs ⋮ Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds ⋮ Eulerian subgraphs and Hamilton-connected line graphs ⋮ Lai's conditions for spanning and dominating closed trails ⋮ On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\) ⋮ Hamiltonicity of 3-connected line graphs ⋮ 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices ⋮ An \(s\)-Hamiltonian line graph problem ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Supereulerian complementary graphs ⋮ Supereulerian graphs and the Petersen graph ⋮ Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected ⋮ Spanning trails in essentially 4-edge-connected graphs ⋮ Collapsible graphs and Hamiltonicity of line graphs ⋮ Hamiltonian connectedness in 3-connected line graphs ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs ⋮ The supereulerian graphs in the graph family \(C(l,k)\) ⋮ Hamilton-connected indices of graphs ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Catlin’s reduced graphs with small orders ⋮ Ons-Hamiltonian Line Graphs ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Group connectivity and matchings ⋮ Spanning trails containing given edges
Cites Work
- Spanning Eulerian subgraphs and matchings
- Reduced graphs of diameter two
- A reduction method to find spanning Eulerian subgraphs
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- A Note on Sub-Eulerian Graphs
- Decomposition of Finite Graphs Into Forests
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs without spanning closed trails
