Split-Perfect Graphs: Characterizations and Algorithmic Use

DOI10.1137/S0895480100367676zbMath1056.05070OpenAlexW1986908827MaRDI QIDQ4652596

Van Bang Le, Andreas Brandstädt

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100367676

zbMATH Keywords

perfect graphsperfectly orderable graphs\(P_4\)-sparse graphsgood characterizationlinear time recognitionbrittle graphssuperbrittle graphs\(P_4\)-laden graphs\(P_4\)-lite graphs\(P_4\)-structure of perfect graphsgraphs with \(P_4\)-structure of split graphsprimeval decomposition tree

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items (7)

The A4-structure of a graph ⋮ Path-bicolorable graphs ⋮ Sum-perfect graphs ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ Bipartite-perfect graphs ⋮ Dynamically maintaining split graphs ⋮ Path-Bicolorable Graphs

This page was built for publication: Split-Perfect Graphs: Characterizations and Algorithmic Use