Coloring graphs with stable cutsets

DOI10.1016/0095-8956(83)90039-4zbMath0498.05028OpenAlexW2028475849MaRDI QIDQ1171066

Alan C. Tucker

Publication date: 1983

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(83)90039-4

zbMATH Keywords

holecircuitvertex-coloringstable cutsetchordless odd-lengthcritical perfect graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (19)

A reduction procedure for coloring perfect \(K_ 4\)-free graphs ⋮ Quasi-parity and perfect graphs ⋮ Building counterexamples ⋮ On edge perfectness and classes of bipartite graphs ⋮ On a conjecture about uniquely colorable perfect graphs ⋮ Algorithms Solving the Matching Cut Problem ⋮ On stable cutsets in line graphs ⋮ Algorithms solving the matching cut problem ⋮ Computation in Causal Graphs ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ Matching cutsets in graphs of diameter 2 ⋮ Disjoint clique cutsets in graphs without long holes ⋮ K4-free graphs with no odd hole: Even pairs and the circular chromatic number ⋮ The complexity of list edge-partitions for simple graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ On stable cutsets in graphs ⋮ Bisplit graphs ⋮ Quasi-star-cutsets and some consequences ⋮ List matrix partitions of chordal graphs

Cites Work

• Topics on perfect graphs
• A characterization of perfect graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring graphs with stable cutsets