Hamilton cycles in split graphs with large minimum degree
From MaRDI portal
Publication:4823301
DOI10.7151/dmgt.1210zbMath1115.05085MaRDI 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
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Linear separation of connected dominating sets in graphs, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, A linear-time algorithm for paired-domination on circular-arc graphs, Solving the path cover problem on circular-arc graphs by using an approximation algorithm, Connected Domination