Hamiltonian shortage, path partitions of vertices, and matchings in a graph
From MaRDI portal
Publication:4128623
DOI10.4064/cm-36-2-305-318zbMath0357.05053MaRDI QIDQ4128623
Publication date: 1976
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-36-2-305-318
Related Items
Unnamed Item, A condition for a graph to contain \(k\)-matching., A linear algorithm for the Hamiltonian completion number of the line graph of a cactus., Local search algorithms for finding the Hamiltonian completion number of line graphs, Hamiltonian path saturated graphs with small size