Covering Graphs by Colored Stable Sets

DOI10.1016/j.endm.2004.03.029zbMath1152.05357OpenAlexW2046679883MaRDI QIDQ3439145

Britta Wienand, Ulrich Faigle, Bernhard Fuchs

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.029

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On approximability of optimization problems related to red/blue-split graphs

Cites Work

• Unnamed Item
• Matching theory
• On chain and antichain families of a partially ordered set
• Some optimal inapproximability results

This page was built for publication: Covering Graphs by Colored Stable Sets