Hamiltonian results inK1,3-free graphs
From MaRDI portal
Publication:3320427
DOI10.1002/jgt.3190080116zbMath0536.05047OpenAlexW2037189698MaRDI QIDQ3320427
David P. Sumner, Manton M. Matthews
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080116
Related Items (only showing first 100 items - show all)
Computing the Scattering Number of Graphs ⋮ Maximal K3's and Hamiltonicity of 4-connected claw-free graphs ⋮ Claw-free graphs and 2-factors that separate independent vertices ⋮ Hamiltonian cycles in n‐extendable graphs ⋮ The complexity of recognizing minimally tough graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ On the Toughness of a Graph ⋮ On Dominating Even Subgraphs in Cubic Graphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ On hamiltonian line graphs of hypergraphs ⋮ The fully weighted toughness of a graph ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs ⋮ On factors of 4-connected 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 ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ 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 ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees whose reducible stems have a few branch vertices ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Unnamed Item ⋮ Hamiltonicity in Partly claw-free graphs ⋮ Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ On the Power of Planned Infections in Networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs ⋮ Hamilton cycles in 6-connected claw-free graphs (Extended abstract) ⋮ Chvátal’s t 0-Tough Conjecture ⋮ Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs ⋮ Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks ⋮ A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs ⋮ Hamiltonicity of bipartite biclaw-free graphs ⋮ Extending cycles locally to Hamilton cycles ⋮ Long paths and cycles in tough graphs ⋮ Hamiltonian cycles in spanning subgraphs of line graphs ⋮ Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ On cycle-nice claw-free graphs ⋮ Tank-ring factors in supereulerian claw-free graphs ⋮ Minimum implicit degree condition restricted to claws for Hamiltonian 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 ⋮ Dirac's minimum degree condition restricted to claws ⋮ Maximum and minimum toughness of graphs of small genus ⋮ Claw-free graphs---a survey ⋮ Hamiltonicity of 2-connected claw-center independent graphs ⋮ Dominating cycles in bipartite biclaw-free graphs ⋮ On a closure concept in claw-free graphs ⋮ Forbidden subgraphs for Hamiltonicity of 1-tough graphs ⋮ The toughness of cubic graphs ⋮ Toughness and Hamiltonicity in \(k\)-trees ⋮ The complexity of recognizing tough cubic graphs ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ On a connection between the existence of k-trees and the toughness of a graph ⋮ Thomassen's conjecture for line graphs of 3-hypergraphs ⋮ Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs ⋮ Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs ⋮ Hamiltonicity in 2-connected graphs with claws ⋮ Hamiltonian cycles in regular 3-connected claw-free graphs ⋮ Hamiltonicity of 6-connected line graphs ⋮ Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs ⋮ Circumferences of 2-factors in claw-free graphs ⋮ Cycles in squares of trees without generalized claws ⋮ Properties of minimally \(t\)-tough graphs ⋮ On Hamiltonicity of 2-connected claw-free graphs ⋮ Packing 3-vertex paths in claw-free graphs and related topics ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ Graphs indecomposable with respect to the X-join ⋮ The spectrum and toughness of regular graphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ Clawfreeness of the powers of a graph ⋮ On 3-connected Hamiltonian line graphs ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Collapsible graphs and Hamiltonian connectedness of line graphs ⋮ On 2-factors with a bounded number of odd components ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Hamiltonian claw-free graphs involving minimum degrees ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ On the line graph of a graph with diameter 2 ⋮ Spanning trees: A survey ⋮ How many conjectures can you stand? A survey ⋮ Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ The longest cycle problem is polynomial on interval graphs ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs
Cites Work
This page was built for publication: Hamiltonian results inK1,3-free graphs
