Dynamic coloring on restricted graph classes
From MaRDI portal
bipartite graphsclique-widthdynamic coloringfixed-parameter tractabilityneighborhood diversityNP-completenessproper coloringtwin-cover
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- Algorithmic meta-theorems for restrictions of treewidth
- An application of simultaneous diophantine approximation in combinatorial optimization
- Approximating clique-width and branch-width
- Complexity of conditional colorability of graphs
- Dynamic chromatic number of bipartite graphs
- Dynamic chromatic number of regular graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Dynamic coloring on restricted graph classes
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 2191997 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- On \(r\)-dynamic coloring of graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- On list coloring and list homomorphism of permutation and interval graphs
- Parameterized algorithms
- Perfect elimination orderings of chordal powers of graphs
- Upper bounds to the clique width of graphs
This page was built for publication: Dynamic coloring on restricted graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985822)
