On a closure concept in claw-free graphs
From MaRDI portal
Publication:1362093
DOI10.1006/jctb.1996.1732zbMath0872.05032OpenAlexW1967979192MaRDI QIDQ1362093
Publication date: 12 August 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.1732
Related Items (only showing first 100 items - show all)
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs ⋮ Circumferences of 3-connected claw-free graphs. II. ⋮ Forbidden pairs of disconnected graphs for traceability in connected graphs ⋮ Even factors with a bounded number of components in iterated line graphs ⋮ Heavy subgraphs, stability and Hamiltonicity ⋮ Maximal K3's and Hamiltonicity of 4-connected claw-free graphs ⋮ Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ Claw-free graphs and 2-factors that separate independent vertices ⋮ Tank-ring factors in supereulerian claw-free graphs ⋮ Perfect matching transitivity of circulant graphs. ⋮ Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ Unnamed Item ⋮ Hamiltonian paths in spanning subgraphs of line graphs ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs ⋮ Degree sums of adjacent vertices for traceability of claw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ 2-Factors in claw-free graphs with locally disconnected vertices ⋮ On Dominating Even Subgraphs in Cubic Graphs ⋮ Hamiltonicities of double domination critical and stable claw-free graphs ⋮ Two completely independent spanning trees of claw-free graphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ Hamilton-connected claw-free graphs with Ore-degree conditions ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ On hamiltonian line graphs of hypergraphs ⋮ Forbidden pairs of disconnected graphs for 2‐factor of connected graphs ⋮ On components of 2-factors in claw-free graphs ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Hamiltonian connected hourglass free line graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Circumferences of regular claw-free graphs ⋮ On Hamiltonicity of \{claw, net\}-free graphs ⋮ On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs ⋮ On 2-factors with a bounded number of odd components ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity ⋮ Hamiltonian claw-free graphs involving minimum degrees ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ On the number of components in 2-factors of claw-free graphs ⋮ On factors of 4-connected claw-free graphs ⋮ Pancyclicity of 4‐Connected, Claw‐Free, P10‐Free Graphs ⋮ Forbidden subgraphs that imply 2-factors ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs ⋮ Unnamed Item ⋮ Toughness in graphs -- a survey ⋮ Hamiltonicity in 3-connected claw-free graphs ⋮ Every 3-connected, essentially 11-connected line graph is Hamiltonian ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Closure operation for even factors on claw-free graphs ⋮ Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian ⋮ 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Hamilton circuits and essential girth of claw free graphs ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ Hamiltonicity in Partly claw-free graphs ⋮ Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected ⋮ Minimal claw-free graphs ⋮ Quartic Graphs with Every Edge in a Triangle ⋮ On stability of Hamilton-connectedness under the 2-closure in claw-free graphs ⋮ Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs ⋮ On the independence number of traceable 2-connected claw-free graphs ⋮ Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs ⋮ Spanning trails in a 2-connected graph ⋮ Hamilton cycles in 6-connected claw-free graphs (Extended abstract) ⋮ Two operations on a graph preserving the (non)existence of 2-factors in its line graph ⋮ The local structure of claw-free graphs without induced generalized bulls ⋮ Stability of Hereditary Graph Classes Under Closure Operations ⋮ Chvátal’s t 0-Tough Conjecture ⋮ Circumference of essentially 4-connected planar triangulations ⋮ Characterization of perfect matching transitive graphs ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs ⋮ The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs ⋮ Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ Hamiltonian claw-free graphs with locally disconnected vertices ⋮ Circumferences of 3-connected claw-free graphs ⋮ Hamiltonian line graphs with local degree conditions ⋮ Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ A twelve vertex theorem for 3-connected claw-free graphs ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles ⋮ Hamiltonian cycles in spanning subgraphs of line graphs ⋮ Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ On Hamiltonicity of regular graphs with bounded second neighborhoods ⋮ Hamilton cycles in line graphs of 3-hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- On hamiltonian line graphs and connectivity
- Tough graphs and Hamiltonian circuits.
- Hamiltonian results inK1,3-free graphs
- Toughness and the existence ofk-factors
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Reflections on graph theory
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
This page was built for publication: On a closure concept in claw-free graphs
