Parameterizing role coloring on forests
From MaRDI portal
Publication:831825
DOI10.1007/978-3-030-67731-2_22zbMath1490.68163OpenAlexW3124411319MaRDI QIDQ831825
Venkatesh Raman, Vibha Sahlot, Sukanya Pandey
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_22
Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Unnamed Item
- Computing role assignments of split graphs
- Computing role assignments of proper interval graphs in polynomial time
- Computing role assignments of chordal graphs
- A complete complexity classification of the role assignment problem
- On the complexity of role colouring planar graphs, trees and cographs
- Role colouring a graph
- Some simplified NP-complete graph problems
- Role coloring bipartite graphs
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- The number of trees
- How hard is it to determine if a graph has a 2-role assignment?
- Color-coding
- Constant Time Generation of Free Trees
- Regular equivalence: General theory
- Graph-Theoretic Concepts in Computer Science
- Parameterized Pre-Coloring Extension and List Coloring Problems
- Fixed-parameter tractability of \((n-k)\) list coloring
This page was built for publication: Parameterizing role coloring on forests
