Abstract
Abstract Let G = ( V , R ∪ B ) be a multigraph with red and blue edges. G is an R / B -split graph if V is the union of a red and a blue stable set. R / B -split graphs yield a common generalization of split graphs and Konig graphs. It is shown, for example, that R / B -split graphs can be recognized in polynomial time. On the other hand, finding a maximal R / B -subgraph is NP -hard already for the class of comparability graphs of series-parallel orders. Moreover, there can be no approximation ratio better than 31/32 unless P = NP .
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
