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

DOI10.4064/CM-36-2-305-318MaRDI QIDQ4128623zbMATH OpenOpenAlexFDO

Authors Zdzisław Skupień

Publication date 1976

Published in Colloquium Mathematicum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Cited in

(5)

• Local search algorithms for finding the Hamiltonian completion number of line graphs
• A condition for a graph to contain k-matching.
• scientific article; zbMATH DE number 2230241 (Why is no real title available?)
• Hamiltonian path saturated graphs with small size
• A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128623)