scientific article; zbMATH DE number 772760
From MaRDI portal
Publication:4838466
zbMath0821.05026MaRDI QIDQ4838466
Publication date: 12 July 1995
Full work available at URL: https://eudml.org/doc/118660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
Algorithmic complexity of list colorings ⋮ Parameterized coloring problems on chordal graphs ⋮ The \(d\)-precoloring problem for \(k\)-degenerate graphs ⋮ On residual approximation in solution extension problems ⋮ Scheduling with incompatible jobs ⋮ Precoloring extension involving pairs of vertices of small distance ⋮ Extending precolorings to distinguish group actions ⋮ Coloring some classes of mixed graphs ⋮ Generalized coloring for tree-like graphs ⋮ Preassignment requirements in chromatic scheduling ⋮ Problems on cycles and colorings ⋮ Distance constraints in graph color extensions ⋮ The complexity of changing colourings with bounded maximum degree ⋮ On the complexity of coloring ‐graphs ⋮ Some good characterization results relating to the Kőnig-Egerváry theorem ⋮ On Residual Approximation in Solution Extension Problems ⋮ On two coloring problems in mixed graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ On coloring problems with local constraints ⋮ On coloring problems with local constraints ⋮ Exploring the complexity boundary between coloring and list-coloring ⋮ Approximation algorithms for time constrained scheduling ⋮ Exploring the complexity boundary between coloring and list-coloring ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Precoloring extension. I: Interval graphs ⋮ Closing complexity gaps for coloring problems on \(H\)-free graphs ⋮ Precoloring extension on unit interval graphs ⋮ Hard coloring problems in low degree planar bipartite graphs ⋮ Precoloring extension of co-Meyniel graphs ⋮ You can't paint yourself into a corner ⋮ Open Problems on Graph Coloring for Special Graph Classes ⋮ Complexity results for minimum sum edge coloring ⋮ Weighted coloring on planar, bipartite and split graphs: Complexity and approximation ⋮ Extending graph colorings ⋮ On the number of precolouring extensions ⋮ Extending partial representations of subclasses of chordal graphs
This page was built for publication:
