Dirac's minimum degree condition restricted to claws

DOI10.1016/S0012-365X(96)00224-5zbMath0880.05062MaRDI QIDQ1356453

Zdeněk Ryjáček, Hajo J. Broersma, Ingo Schiermeyer

Publication date: 19 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonianclawperfect matchingstoughnessDirac's minimum degree condition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

Heavy subgraphs, stability and Hamiltonicity, Hamilton cycles in implicit 2-heavy graphs, Minimum implicit degree condition restricted to claws for Hamiltonian cycles, Hamilton cycles in almost distance-hereditary graphs, Hamilton cycles in implicit claw-heavy graphs, An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian, On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs, Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity, Heavy subgraph pairs for traceability of block-chains, Implicit degree condition for Hamiltonicity of 2-heavy graphs, Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs, Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs, Degree conditions on claws and modified claws for Hamiltonicity of graphs, Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†, Degree conditions on induced claws, The cycle spectrum of claw-free Hamiltonian graphs, Hamilton cycles in claw-heavy graphs, Characterizing heavy subgraph pairs for pancyclicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• New sufficient conditions for cycles in graphs
• A method in graph theory
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• Sufficient conditions for a graph to be Hamiltonian
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Hamiltonian results inK1,3-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• 2‐neighborhoods and hamiltonian conditions
• Graphs with 1-Factors
• 1-Factors and Antifactor Sets
• Some Theorems on Abstract Graphs