Hamiltonian shortage, path partitions of vertices, and matchings in a graph

DOI10.4064/cm-36-2-305-318zbMath0357.05053OpenAlexW841821653MaRDI QIDQ4128623

Zdzisław Skupień

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (5)

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 ⋮ Unnamed Item

This page was built for publication: Hamiltonian shortage, path partitions of vertices, and matchings in a graph