Note on maximal split-stable subgraphs

DOI10.1016/J.DAM.2007.04.009MaRDI QIDQ2381823zbMATH OpenOpenAlexFDO

Authors U. Faigle, Bernhard Fuchs, Britta Peis

Publication date 19 September 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.04.009

zbMATH Keywords

computational complexitymatroidspartitioningstable sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Covering Graphs by Colored Stable Sets
• On approximability of optimization problems related to red/blue-split graphs
• On split-coloring problems
• Structure analysis of some generalizations of matchings and matroids under algorithmic aspects
• Edge Coloring of Split Graphs

Cites work

• An efficiently solvable graph partition problem to which many problems are reducible
• Geometric algorithms and combinatorial optimization.
• Graph Classes: A Survey
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Incidence matrices and interval graphs
• Matching theory
• On chain and antichain families of a partially ordered set
• Some optimal inapproximability results
• Some partitions associated with a partially ordered set
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• The structure of Sperner k-families

Cited in

(3)

• Structure analysis of some generalizations of matchings and matroids under algorithmic aspects
• Covering Graphs by Colored Stable Sets
• Algorithms on Subtree Filament Graphs

This page was built for publication: Note on maximal split-stable subgraphs

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