Hamiltonian results inK1,3-free graphs

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

zbMATH Keywords

Hamiltonian graphspowers of graphsvertex pancyclic

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (only showing first 100 items - show all)

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 ⋮ A large class of maximally tough graphs ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ On the number of components in 2-factors of claw-free graphs ⋮ Spanning trees with few peripheral branch vertices ⋮ Hamiltonicity in claw-free graphs ⋮ Forbidden subgraphs that imply 2-factors ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Connected even factors in claw-free graphs ⋮ The spanning connectivity of line graphs ⋮ The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs ⋮ What is on his mind? ⋮ Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ The Ryjáček closure and a forbidden subgraph ⋮ Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks ⋮ Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\) ⋮ Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs ⋮ Bipartite toughness and \(k\)-factors in bipartite graphs ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ Collapsible graphs and Hamiltonicity of line graphs ⋮ On Hamiltonicity of 3-connected claw-free graphs ⋮ On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs ⋮ Implementation of RTO in a large hydrogen network considering uncertainty ⋮ Connected even factors in \(k\)-tree ⋮ Toughness, forbidden subgraphs, and Hamilton-connected graphs ⋮ Forbidden pairs for \(k\)-connected Hamiltonian graphs ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs ⋮ Closure concepts for claw-free graphs ⋮ Triangles in claw-free graphs ⋮ On connected factors in \(K_{1,3}\)-free graphs ⋮ Forbidden triples and traceability: A characterization ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Line graphs and forbidden induced subgraphs ⋮ Hamiltonicity and minimum degree in 3-connected claw-free graphs ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected ⋮ 9-connected claw-free graphs are Hamilton-connected ⋮ On hamiltonian line graphs and connectivity ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets ⋮ A condition on Hamilton-connected line graphs

Cites Work

• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Hamiltonian results inK1,3-free graphs