Partition the vertices of a graph into induced matchings
From MaRDI portal
Publication:1869233
DOI10.1016/S0012-365X(02)00791-4zbMath1014.05055OpenAlexW2044057917MaRDI QIDQ1869233
Publication date: 9 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00791-4
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Induced star partition of graphs ⋮ Unnamed Item ⋮ Partition a graph with small diameter into two induced matchings
This page was built for publication: Partition the vertices of a graph into induced matchings