scientific article; zbMATH DE number 7058467
From MaRDI portal
Publication:5377224
zbMATH Open1411.05089arXiv1810.13036MaRDI QIDQ5377224FDOQ5377224
Authors: Guilherme de C. M. Gomes, Carlos Vinícius G. C. Lima, Vinícius F. dos Santos 
Publication date: 23 May 2019
Full work available at URL: https://arxiv.org/abs/1810.13036
Title of this publication is not available (Why is that?)
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 (12)
- Gap one bounds for the equitable chromatic number of block graphs
- A polyhedral approach for the equitable coloring problem
- Approximation algorithms for job scheduling with block-type conflict graphs
- A flow based pruning scheme for enumerative equitable coloring algorithms
- Title not available (Why is that?)
- Complexity of tree-coloring interval graphs equitably
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Iterated Type Partitions
- A fast algorithm for equitable coloring
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- Parameterized complexity for iterated type partitions and modular-width
- What makes equitable connected partition easy
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)
