Graphs without spanning closed trails
From MaRDI portal
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
- A Note on Sub-Eulerian Graphs
- A reduction method to find spanning Eulerian subgraphs
- Decomposition of Finite Graphs Into Forests
- Graph theory
- scientific article; zbMATH DE number 3987316 (Why is no real title available?)
- scientific article; zbMATH DE number 4055653 (Why is no real title available?)
- scientific article; zbMATH DE number 4077283 (Why is no real title available?)
- scientific article; zbMATH DE number 26482 (Why is no real title available?)
- scientific article; zbMATH DE number 867689 (Why is no real title available?)
- Reduced graphs of diameter two
- Spanning Eulerian subgraphs and matchings
- Supereulerian graphs: A survey
- The spanning subgraphs of eulerian graphs
Cited in
(83)- Hamiltonian connectedness in 3-connected line graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
- Hamilton-connected indices of graphs
- Degree sum and Hamiltonian-connected line graphs
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Collapsible subgraphs of a 4-edge-connected graph
- Eulerian subgraphs and Hamilton-connected line graphs
- Graphs without dead ends
- Group connectivity in 3-edge-connected graphs
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- Complete family reduction and spanning connectivity in line graphs
- Hamiltonian line graphs with local degree conditions
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
- On the s-hamiltonianicity of an hourglass-free line graph
- Strengthened Ore conditions for (s, t)-supereulerian graphs
- On sufficient degree conditions for traceability of claw-free graphs
- Chvátal-Erdős conditions and almost spanning trails
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- On the line graph of a graph with diameter 2
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Lai's conditions for spanning and dominating closed trails
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Group connectivity and matchings
- Circumferences of 3-connected claw-free graphs. II.
- Spanning trails with variations of Chvátal-Erdős conditions
- Supereulerian width of dense graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Traceability on 2-connected line graphs
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- On spanning disjoint paths in line graphs
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Circumferences of 3-connected claw-free graphs
- Super-Eulerian graphs of minimum degree at least 4.
- On s-Hamiltonian line graphs
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- scientific article; zbMATH DE number 4077283 (Why is no real title available?)
- On 1-Hamilton-connected claw-free graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- Spanning cycles in regular matroids without small cocircuits
- scientific article; zbMATH DE number 1778387 (Why is no real title available?)
- Supereulerian complementary graphs
- scientific article; zbMATH DE number 867689 (Why is no real title available?)
- Catlin's reduced graphs with small orders
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
- Degree sums of adjacent vertices for traceability of claw-free graphs
- Forbidden pairs for spanning (closed) trails
- Spectral and extremal conditions for supereulerian graphs
- Supereulerian graphs and the Petersen graph
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Group connectivity under 3‐edge‐connectivity
- Hamilton-connected claw-free graphs with Ore-degree conditions
- Hamiltonicity of 6-connected line graphs
- Supereulerian regular matroids without small cocircuits
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
- Supereulerian graphs in the graph family \(C_{2}(6,k)\)
- Supereulerian graphs and matchings
- On 3-edge-connected supereulerian graphs
- How many conjectures can you stand? A survey
- Squares of graphs are optimally (s, t)-supereulerian
- Graphs with supereulerian width 3 and small diameters
- Hamilton-connected claw-free graphs with minimum-degree conditions
- Hamiltonian claw-free graphs with path-type local degree conditions
- The independence number and chromatic number in a reduced graph
- Exploring Hamilton-connectedness in \(\{K_{1, 3}, \Gamma_0, P_{18} \}\)-free graphs
- Spanning trails avoiding and containing given edges
- Edge degree conditions for dominating and spanning closed trails
- On \(s\)-Hamiltonian-connected line graphs
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- Hamiltonicity of 3-connected line graphs
- Every 4-connected \{claw, hourglass\}-free graph is 2-Hamiltonian
- Spanning trails in essentially 4-edge-connected graphs
- Collapsible graphs and Hamiltonicity of line graphs
- Spanning trails containing given edges
- Fan-type conditions for spanning Eulerian subgraphs
- Graphs with a 3-cycle-2-cover
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- On \(s\)-Hamiltonian-connected line graphs
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- An s-Hamiltonian line graph problem
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)
