Partition the vertices of a graph into induced matchings

DOI10.1016/S0012-365X(02)00791-4zbMATH Open1014.05055OpenAlexW2044057917MaRDI QIDQ1869233FDOQ1869233

Authors: Jinjiang Yuan, Qin Wang 

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

Recommendations

• On induced matchings
• Some results on dominating induced matchings
• scientific article; zbMATH DE number 1286491
• Induced matchings in bipartite graphs
• Partition a graph with small diameter into two induced matchings

zbMATH Keywords

partitioncolouringinduced matchingperfect matching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (8)

• Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
• Title not available (Why is that?)
• Composing dynamic programming tree-decomposition-based algorithms
• Title not available (Why is that?)
• On induced matchings
• Induced star partition of graphs
• Successive partition of edges of bipartite graph into matchings
• 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

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