Recognizing Perfect 2-Split Graphs

DOI10.1137/S0895480197329089MaRDI QIDQ4943703zbMATH OpenOpenAlexFDO

Authors Van Bang Le, Chính T. Hoàng

Publication date 19 March 2000

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

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

zbMATH Keywords

graph coloringperfect graphsplit graph

Mathematics Subject Classification ID

Perfect graphs (05C17)

Recommendations

• 2-split graphs
• Two classes of perfect graphs
• Split-Perfect Graphs: Characterizations and Algorithmic Use
• scientific article; zbMATH DE number 1696523
• scientific article; zbMATH DE number 1156661
• On class 2 split graphs
• Recognizing sparse perfect elimination bipartite graphs
• Recognizing bull-free perfect graphs
• A note on the recognition of bisplit graphs
• A unified approach to recognize squares of split graphs

Cited in

(16)

• Linear recognition of pseudo-split graphs
• Split-neighbourhood graphs and the strong perfect graph conjecture
• Finding induced paths of given parity in claw-free graphs
• Classes of perfect graphs
• Bisplit graphs
• 2-split graphs
• On generalized split graphs
• Recognizing Dart-Free Perfect Graphs
• On split and almost CIS-graphs
• scientific article; zbMATH DE number 3908483 (Why is no real title available?)
• scientific article; zbMATH DE number 3970804 (Why is no real title available?)
• Fast recognition of doubled graphs
• Split-Perfect Graphs: Characterizations and Algorithmic Use
• Partitioning chordal graphs into independent sets and cliques
• Finding an induced path of given parity in planar graphs in polynomial time
• Nonsplit Graphs with Split Maximal Induced Subgraphs

This page was built for publication: Recognizing Perfect 2-Split Graphs

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