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