Split-perfect graphs: Characterizations and algorithmic use

DOI10.1007/3-540-40064-8_8MaRDI QIDQ2766671zbMATH OpenFDO

Authors Andreas Brandstädt, Van Bang Le

Publication date 14 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40064-8_8

zbMATH Keywords

brittle graphscharacterizationchordless pathlinear time algorithmsoptimizationrecognition algorithmsplit graphsplit-perfect graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Split-Perfect Graphs: Characterizations and Algorithmic Use
• scientific article; zbMATH DE number 3970804
• scientific article; zbMATH DE number 3898942
• Split-neighbourhood graphs and the strong perfect graph conjecture
• An algorithmic characterization of splitting signed graph
• Split graphs and Nordhaus-Gaddum graphs
• Splittable and unsplittable graphs and configurations
• Perfect graphs, partitionable graphs and cutsets
• On generalized split graphs
• Algorithms for unipolar and generalized split graphs

Cited in

(4)

• Linear recognition of pseudo-split graphs
• An algorithmic characterization of splitting signed graph
• Split-Perfect Graphs: Characterizations and Algorithmic Use
• Recognizing Perfect 2-Split Graphs

This page was built for publication: Split-perfect graphs: Characterizations and algorithmic use

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