scientific article; zbMATH DE number 7058467
From MaRDI portal
Publication:5377224
Recommendations
- Structural parameterizations for equitable coloring
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- On certain parameters of equitable coloring of graphs
- Equitable coloring parameters of certain graph classes
- A polyhedral approach for the equitable coloring problem
- Polyhedral results for the equitable coloring problem
- scientific article; zbMATH DE number 1302199
- Equitable coloring of hypergraphs
- A fast algorithm for equitable coloring
- scientific article; zbMATH DE number 3378938
Cited in
(20)- A flow based pruning scheme for enumerative equitable coloring algorithms
- Complexity of tree-coloring interval graphs equitably
- On the complexity of local-equitable coloring of graphs
- Structural parameterizations for equitable coloring
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Tree-coloring problems of bounded treewidth graphs
- A polyhedral approach for the equitable coloring problem
- What makes equitable connected partition easy
- Iterated Type Partitions
- A fast algorithm for equitable coloring
- Grundy distinguishes treewidth from pathwidth
- Structural parameterizations of budgeted graph coloring
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- Parameterized complexity for iterated type partitions and modular-width
- Gap one bounds for the equitable chromatic number of block graphs
- Approximation algorithms for job scheduling with block-type conflict graphs
- Block graphs -- some general results and their equitable colorings
- Algorithms and complexity for geodetic sets on interval and chordal graphs
- On odd coloring of graphs
- Precoloring extension with demands on paths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377224)
