Equitable colorings of bounded treewidth graphs
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A note on the decomposition of graphs into isomorphic matchings
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Automata, Languages and Programming
- Bounded vertex coloring of trees
- Bounded vertex colorings of graphs
- Chromatic optimisation: Limitations, objectives, uses, references
- Complexity Results for Bandwidth Minimization
- Edge dominating set and colorings on graphs with fixed clique-width
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Equitable and proportional coloring of trees
- Equitable coloring of trees
- scientific article; zbMATH DE number 1640601 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302199 (Why is no real title available?)
- scientific article; zbMATH DE number 219236 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 871903 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Mutual exclusion scheduling
- NP-completeness of graph decomposition problems
- On Equitable Coloring of d-Degenerate Graphs
- Restrictions of graph partition problems. I
- The $L(2,1)$-Labeling Problem on Graphs
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- The χt-coloring problem
Cited in
(36)- Decomposition, reformulation, and diving in university course timetabling
- Complexity of tree-coloring interval graphs equitably
- Structural parameterizations for equitable coloring
- On the equitable choosability of the disjoint union of stars
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Equitable list tree-coloring of bounded treewidth graphs
- Tree-coloring problems of bounded treewidth graphs
- Equitable colorings of corona multiproducts of graphs
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- A c^k n 5-approximation algorithm for treewidth
- On equitable coloring of central graphs and total graphs
- On equitable colouring of Knödel graphs
- On the Complexity of Some Colorful Problems Parameterized by Treewidth
- Locally boundedk-colorings of trees
- What makes equitable connected partition easy
- scientific article; zbMATH DE number 6863823 (Why is no real title available?)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Iterated Type Partitions
- scientific article; zbMATH DE number 6452992 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
- Parameterized complexity for iterated type partitions and modular-width
- Complexity aspects of restrained Roman domination in graphs
- Scheduling with machine conflicts
- On the complexity of some colorful problems parameterized by treewidth
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Gap one bounds for the equitable chromatic number of block graphs
- Block graphs -- some general results and their equitable colorings
- State canonization and early pruning in width-based automated theorem proving
- Equitable connected partition and structural parameters revisited: N-fold beats Lenstra
- The equitable chromatic number of circulant graphs with maximum degree at most 4
- Concurrency constrained scheduling with tree-like constraints
This page was built for publication: Equitable colorings of bounded treewidth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817768)
