scientific article; zbMATH DE number 1833421
From MaRDI portal
Publication:4780802
Recommendations
Cited in
(34)- A note on the equitable choosability of complete bipartite graphs
- On list equitable total colorings of the generalized theta graph
- Equitable coloring of some convex polytope graphs
- Equitable defective coloring of sparse planar graphs
- On the equitable choosability of the disjoint union of stars
- Improved distributed approximations for maximum independent set
- Linear classifiers are nearly optimal when hidden variables have diverse effects
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
- An Ore-type theorem on equitable coloring
- scientific article; zbMATH DE number 7561635 (Why is no real title available?)
- Equitable colorings extend Chernoff-Hoeffding bounds
- A refinement of a result of Corrádi and Hajnal
- scientific article; zbMATH DE number 6452992 (Why is no real title available?)
- Equitable coloring of random graphs
- A simple characterization of proportionally 2-choosable graphs
- Proportional choosability of complete bipartite graphs
- Proportional choosability: a new list analogue of equitable coloring
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Equitable and list equitable colorings of planar graphs without 4-cycles
- scientific article; zbMATH DE number 437558 (Why is no real title available?)
- Total equitable list coloring
- Proportional 2-choosability with a bounded palette
- The Randomized Coloring Procedure with Symmetry-Breaking
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- New global optima results for the Kauffman \(NK\) model: Handling dependency
- Equitable colorings of Kronecker products of graphs
- Derandomizing local distributed algorithms under bandwidth restrictions
- A DSATUR-based algorithm for the equitable coloring problem
- A polyhedral approach for the equitable coloring problem
- Ore-type versions of Brooks' theorem
- \(t\)-wise independence with local dependencies
- A tabu search heuristic for the equitable coloring problem
- Improving lower bounds for equitable chromatic number
- Equitable colorings of Cartesian products of graphs
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 Q4780802)