scientific article; zbMATH DE number 1033812
From MaRDI portal
Publication:4344207
Recommendations
- scientific article; zbMATH DE number 1944138
- Perfect colorings of regular graphs
- Perfectly colorable graphs
- Coloring perfect degenerate graphs
- An algorithm for coloring some perfect graphs
- Precoloring Extension III: Classes of Perfect Graphs
- On perfect colorings of line graphs
- Colouring Some Classes of Perfect Graphs Robustly
- Coloring planar perfect graphs by decomposition
- Coloring bull-free perfect graphs
Cited in
(18)- Extension problems with degree bounds
- Channel assignment on graphs of bounded treewidth
- Complexity of choosing subsets from color sets
- Systems of distant representatives
- Partitioning chordal graphs into independent sets and cliques
- The d-precoloring problem for k-degenerate graphs
- Perfect colorings of the prism graph
- On the computational complexity of partial covers of theta graphs
- Precoloring extension on unit interval graphs
- Precoloring extension on chordal graphs
- Colouring Some Classes of Perfect Graphs Robustly
- Precoloring Extension III: Classes of Perfect Graphs
- Coloring perfect graphs with no balanced skew-partitions
- On coloring problems with local constraints
- On coloring problems with local constraints
- Combinatorial optimization with 2-joins
- List homomorphisms of graphs with bounded degrees
- Precoloring extension of co-Meyniel graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344207)