Graphs without spanning closed trails
From MaRDI portal
Publication:1126285
DOI10.1016/S0012-365X(95)00149-QzbMATH Open0859.05060MaRDI QIDQ1126285FDOQ1126285
Authors: Paul A. Catlin, Zheng-Yiao Han, Hong-Jian Lai 
Publication date: 7 April 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Spanning closed trails in graphs
- Graphs without dead ends
- scientific article; zbMATH DE number 27751
- Connected graphs without long paths
- Graphs without cycles of even length
- scientific article; zbMATH DE number 15461
- scientific article; zbMATH DE number 6438262
- Graphs without four-cycles
- scientific article; zbMATH DE number 1933072
- Directed graphs without short cycles
Cites Work
- Graph theory
- A reduction method to find spanning Eulerian subgraphs
- Decomposition of Finite Graphs Into Forests
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
- A Note on Sub-Eulerian Graphs
- Title not available (Why is that?)
- Spanning Eulerian subgraphs and matchings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduced graphs of diameter two
- Title not available (Why is that?)
Cited In (74)
- Degree sums of adjacent vertices for traceability of claw-free graphs
- Group connectivity and matchings
- Group connectivity under 3‐edge‐connectivity
- Squares of graphs are optimally \((s, t)\)-supereulerian
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Supereulerian regular matroids without small cocircuits
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
- On sufficient degree conditions for traceability of claw-free graphs
- Hamilton-connected claw-free graphs with Ore-degree conditions
- Graphs with supereulerian width 3 and small diameters
- On 1-Hamilton-connected claw-free graphs
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- Supereulerian complementary graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
- Traceability on 2-connected line graphs
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Circumferences of 3-connected claw-free graphs
- How many conjectures can you stand? A survey
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- Catlin's reduced graphs with small orders
- On \(s\)-Hamiltonian-connected line graphs
- On the line graph of a graph with diameter 2
- Hamiltonicity of 6-connected line graphs
- Collapsible subgraphs of a 4-edge-connected graph
- Fan-type conditions for spanning Eulerian subgraphs
- Hamiltonian line graphs with local degree conditions
- Collapsible graphs and Hamiltonian connectedness of line graphs
- On \(s\)-Hamiltonian line graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- On the \(s\)-hamiltonianicity of an hourglass-free line graph
- Spanning cycles in regular matroids without small cocircuits
- Super-Eulerian graphs of minimum degree at least \(4\).
- Hamiltonicity of 3-connected line graphs
- Graphs without dead ends
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- On spanning disjoint paths in line graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- Hamiltonian connectedness in 3-connected line graphs
- Spanning trails in essentially 4-edge-connected graphs
- Title not available (Why is that?)
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Spanning trails containing given edges
- Circumferences of 3-connected claw-free graphs. II.
- Title not available (Why is that?)
- Degree sum and Hamiltonian-connected line graphs
- Graphs with a 3-cycle-2-cover
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- Strengthened Ore conditions for \((s, t)\)-supereulerian graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Chvátal-Erdős conditions and almost spanning trails
- Group connectivity in 3-edge-connected graphs
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- Collapsible graphs and Hamiltonicity of line graphs
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Hamilton-connected indices of graphs
- Supereulerian graphs and the Petersen graph
- On 3-edge-connected supereulerian graphs
- Forbidden pairs for spanning (closed) trails
- Lai's conditions for spanning and dominating closed trails
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
- Supereulerian width of dense graphs
- An \(s\)-Hamiltonian line graph problem
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Supereulerian graphs and matchings
- Spectral and extremal conditions for supereulerian graphs
- Complete family reduction and spanning connectivity in line graphs
- Spanning trails with variations of Chvátal-Erdős conditions
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
This page was built for publication: Graphs without spanning closed trails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126285)
