Dynamic coloring on restricted graph classes
From MaRDI portal
Publication:6057319
DOI10.1007/978-3-031-30448-4_9MaRDI QIDQ6057319
Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
bipartite graphsdynamic coloringneighborhood diversityfixed-parameter tractableproper coloringtwin-cover
Cites Work
- Unnamed Item
- On \(r\)-dynamic coloring of graphs
- Fundamentals of parameterized complexity
- On dynamic coloring for planar graphs and graphs of higher genus
- Dynamic chromatic number of regular graphs
- Complexity of conditional colorability of graphs
- An application of simultaneous diophantine approximation in combinatorial optimization
- Algorithmic meta-theorems for restrictions of treewidth
- Dynamic coloring and list dynamic coloring of planar graphs
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- Algorithmic Aspects of Vertex Elimination on Graphs
- Dynamic Chromatic Number of Bipartite Graphs
- On List Coloring and List Homomorphism of Permutation and Interval Graphs
- Parameterized Algorithms
This page was built for publication: Dynamic coloring on restricted graph classes
