scientific article; zbMATH DE number 772760
From MaRDI portal
Publication:4838466
Recommendations
Cited in
(46)- 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
- Precoloring extension. I: Interval graphs
- You can't paint yourself into a corner
- Algorithmic complexity of list colorings
- Scheduling with incompatible jobs
- Generalized coloring for tree-like graphs
- Preassignment requirements in chromatic scheduling
- Extending graph colorings
- On the number of precolouring extensions
- On residual approximation in solution extension problems
- Extending precolorings to distinguish group actions
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- Closing complexity gaps for coloring problems on \(H\)-free graphs
- Extending partial representations of subclasses of chordal graphs
- The d-precoloring problem for k-degenerate graphs
- On two coloring problems in mixed graphs
- Precoloring extension on unit interval graphs
- Hard coloring problems in low degree planar bipartite graphs
- Precoloring extension involving pairs of vertices of small distance
- Open problems on graph coloring for special graph classes
- On Residual Approximation in Solution Extension Problems
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs
- Problems on cycles and colorings
- The complexity of changing colourings with bounded maximum degree
- NP completeness of the edge precoloring extension problem on bipartite graphs
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 772747 (Why is no real title available?)
- Precoloring Extension III: Classes of Perfect Graphs
- Parameterized and Exact Computation
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
- Precoloring Extension for 2‐connected Graphs
- 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
- On the complexity of coloring ‐graphs
- Some good characterization results relating to the Kőnig-Egerváry theorem
- Approximation algorithms for time constrained scheduling
- Parameterized coloring problems on chordal graphs
- Coloring problems on bipartite graphs of small diameter
- Coloring some classes of mixed graphs
- Distance constraints in graph color extensions
- 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 Q4838466)
