Hamilton cycles in split graphs with large minimum degree
From MaRDI portal
Publication:4823301
DOI10.7151/dmgt.1210zbMath1115.05085OpenAlexW2018508347MaRDI QIDQ4823301
Publication date: 27 October 2004
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1210
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs ⋮ Connected Domination ⋮ Linear separation of connected dominating sets in graphs ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm ⋮ A linear-time algorithm for paired-domination on circular-arc graphs
This page was built for publication: Hamilton cycles in split graphs with large minimum degree