Precoloring Extension III: Classes of Perfect Graphs
From MaRDI portal
Publication:4883061
Recommendations
Cites work
- A characterization of perfect graphs
- A Linear Recognition Algorithm for Cographs
- Algorithmic complexity of list colorings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Blocking and anti-blocking pairs of polyhedra
- Complement reducible graphs
- Difference graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Extending an edge-coloring
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Perfect Elimination and Chordal Bipartite Graphs
- Precoloring extension. I: Interval graphs
- Slim graphs
- The ellipsoid method and its consequences in combinatorial optimization
- Two graph-colouring games
Cited in
(47)- Complexity results for minimum sum edge coloring
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Precoloring extension for 2-connected graphs with maximum degree three
- You can't paint yourself into a corner
- An algorithm for coloring some perfect graphs
- Extending partial colorings of graphs
- Extending graph colorings
- Complexity of choosing subsets from color sets
- On the number of precolouring extensions
- Extending precolorings to distinguish group actions
- Systems of distant representatives
- Perfectly colorable graphs
- On list \(k\)-coloring convex bipartite graphs
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- The d-precoloring problem for k-degenerate graphs
- Classes of perfect graphs
- Precoloring extension on unit interval graphs
- Precoloring extension involving pairs of vertices of small distance
- Two-colourings that decompose perfect graphs
- Open problems on graph coloring for special graph classes
- \(B\)-coloring of \(m\)-tight graphs
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Precoloring extension on chordal graphs
- Characterisations and Linear-Time Recognition of Probe Cographs
- Incremental list coloring of graphs, parameterized by conservation
- The complexity of changing colourings with bounded maximum degree
- A good characterization of cograph contractions
- scientific article; zbMATH DE number 512918 (Why is no real title available?)
- scientific article; zbMATH DE number 1033812 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 772760 (Why is no real title available?)
- Parameterized and Exact Computation
- On coloring problems with local constraints
- On coloring problems with local constraints
- Exploring the complexity boundary between coloring and list-coloring
- Exploring the complexity boundary between coloring and list-coloring
- Flexible list colorings in graphs with special degeneracy conditions
- Flexible List Colorings in Graphs with Special Degeneracy Conditions
- Solving problems on generalized convex graphs via mim-width
- Some good characterization results relating to the Kőnig-Egerváry theorem
- Approximation algorithms for time constrained scheduling
- Improved approximation algorithms for bin packing with conflicts
- Parameterized coloring problems on chordal graphs
- Coloring problems on bipartite graphs of small diameter
- Distance constraints in graph color extensions
- Two-dimensional packing with conflicts
- Precoloring extension of co-Meyniel graphs
This page was built for publication: Precoloring Extension III: Classes of Perfect Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883061)
