Decomposition of perfect graphs

DOI10.1016/0095-8956(87)90031-1zbMath0587.05037OpenAlexW2049723007MaRDI QIDQ1072566

Wenlian Hsu

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90031-1

zbMATH Keywords

graph colouringperfect graphsgraph decompositiongraph compositioninduced cycles2-amalgam split2-composition operation

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Graph classes with structured neighborhoods and algorithmic applications ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ On critically perfect graphs ⋮ Domination graphs: Examples and counterexamples ⋮ \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth ⋮ Boolean-width of graphs ⋮ Boolean-Width of Graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ On perfectness of sums of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Coloring planar perfect graphs by decomposition
• Star-cutsets and perfect graphs
• Critical perfect graphs and perfect 3-chromatic graphs
• Compositions for perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Transformations which Preserve Perfectness and H-Perfectness of Graphs