Pages that link to "Item:Q4883061"
From MaRDI portal
The following pages link to Precoloring Extension III: Classes of Perfect Graphs (Q4883061):
Displaying 37 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- Extending graph colorings (Q1569052) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- On the number of precolouring extensions (Q1590211) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Systems of distant representatives (Q1764814) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Precoloring extension involving pairs of vertices of small distance (Q2636808) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- b-coloring of m-tight graphs (Q2840540) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- A good characterization of cograph contractions (Q4238044) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- Flexible list colorings in graphs with special degeneracy conditions (Q6046649) (← links)
- Flexible List Colorings in Graphs with Special Degeneracy Conditions (Q6065433) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
