Covering Graphs by Colored Stable Sets

DOI10.1016/J.ENDM.2004.03.029MaRDI QIDQ3439145zbMATH OpenOpenAlexFDO

Authors U. Faigle, Bernhard Fuchs, Britta Wienand

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)

Recommendations

• Note on maximal split-stable subgraphs
• On approximability of optimization problems related to red/blue-split graphs
• On split-coloring problems
• Rainbow graph splitting
• On the approximation of Min Split-coloring and Min Cocoloring

Cites work

• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• Matching theory
• On chain and antichain families of a partially ordered set
• Some optimal inapproximability results

Cited in

(8)

• Rainbow graph splitting
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• scientific article; zbMATH DE number 5914964 (Why is no real title available?)
• Vertex coverings by coloured induced graphs — Frames and Umbrellas
• Note on maximal split-stable subgraphs
• Maximum-weight stable sets and safe lower bounds for graph coloring
• scientific article; zbMATH DE number 863472 (Why is no real title available?)
• On approximability of optimization problems related to red/blue-split graphs

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

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