Coloring graphs with stable cutsets

DOI10.1016/0095-8956(83)90039-4MaRDI QIDQ1171066zbMATH OpenOpenAlexFDO

Authors 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

chordless odd-lengthcircuitcritical perfect graphholestable cutsetvertex-coloring

Mathematics Subject Classification ID

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

Cites work

• A characterization of perfect graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3322854 (Why is no real title available?)
• Topics on perfect graphs

Cited in

(24)

• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• A reduction procedure for coloring perfect \(K_ 4\)-free graphs
• Quasi-parity and perfect graphs
• Building counterexamples
• On a conjecture about uniquely colorable perfect graphs
• On stable cutsets in line graphs
• On stable cutsets in graphs
• Quasi-star-cutsets and some consequences
• On edge perfectness and classes of bipartite graphs
• Bisplit graphs
• Algorithms Solving the Matching Cut Problem
• \(K_{4}\)-free graphs with no odd hole: even pairs and the circular chromatic number
• Disjoint clique cutsets in graphs without long holes
• Computation in causal graphs
• Exact and parameterized algorithms for the independent cutset problem
• On polynomial kernelization for stable cutset
• Revisiting extremal graphs having no stable cutsets
• Forest cuts in sparse graphs
• On polynomial kernelization for stable cutset
• The complexity of list edge-partitions for simple graphs
• List matrix partitions of chordal graphs
• Algorithms solving the matching cut problem
• On stable cutsets in claw-free graphs and planar graphs
• Matching cutsets in graphs of diameter 2

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

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