Dirac's minimum degree condition restricted to claws

@article{Broersma1995DiracsMD,
  title={Dirac's minimum degree condition restricted to claws},
  author={Haitze J. Broersma and Zdenek Ryj{\'a}cek and Ingo Schiermeyer},
  journal={Discrete Mathematics},
  year={1995},
  volume={167-168},
  pages={155-166}
}
Let G be a graph on n 3 vertices. Dirac's minimum degree condition is the condition that all vertices of G have degree at least . This is a well-known sufficient condition for the existence of a Hamilton cycle in G. We give related sufficiency conditions for the existence of a Hamilton cycle or a perfect matching involving a restriction of Dirac's minimum degree condition to certain subsets of the vertices. For this purpose we define G to be 1-heavy (2-heavy) if at least one (two) of the end… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity

  • Inf. Process. Lett.
  • 2013
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Hamilton cycles in almost distance-hereditary graphs

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Hamilton cycles in claw-heavy graphs

  • Discrete Mathematics
  • 2009
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Heavy subgraphs, stability and Hamiltonicity

  • Discussiones Mathematicae Graph Theory
  • 2017
VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

Characterizing Heavy Subgraph Pairs for Pancyclicity

  • Graphs and Combinatorics
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

The Cycle Spectrum of Claw-free Hamiltonian Graphs

  • Graphs and Combinatorics
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Similar Papers

Loading similar papers…