Coloring graphs with stable cutsets
From MaRDI portal
Cites work
Cited in
(20)- Algorithms Solving the Matching Cut Problem
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Quasi-parity and perfect graphs
- Bisplit graphs
- Quasi-star-cutsets and some consequences
- On stable cutsets in line graphs
- The complexity of list edge-partitions for simple graphs
- Disjoint clique cutsets in graphs without long holes
- \(K_{4}\)-free graphs with no odd hole: even pairs and the circular chromatic number
- On edge perfectness and classes of bipartite graphs
- Algorithms solving the matching cut problem
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- On a conjecture about uniquely colorable perfect graphs
- Matching cutsets in graphs of diameter 2
- Exact and parameterized algorithms for the independent cutset problem
- Building counterexamples
- Computation in causal graphs
- On stable cutsets in graphs
- On stable cutsets in claw-free graphs and planar graphs
- List matrix partitions of chordal graphs
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)