The following pages link to Equitable Coloring (Q4404923):
Displaying 50 items.
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- Equitable and list equitable colorings of planar graphs without 4-cycles (Q389204) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs (Q401157) (← links)
- Equitable \(\Delta\)-coloring of graphs (Q411652) (← links)
- Equitable colorings of Cartesian products with balanced complete multipartite graphs (Q476328) (← links)
- On \(b\)-chromatic number with other types of chromatic numbers on double star graphs (Q480426) (← links)
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- Coloring the square of Sierpiński graphs (Q497382) (← links)
- On equitable and equitable list colorings of series-parallel graphs (Q534037) (← links)
- Equitable coloring on total graph of bigraphs and central graph of cycles and paths (Q539352) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Equitable and equitable list colorings of graphs (Q604470) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- On equitable colorings of sparse graphs (Q726517) (← links)
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
- Equitable colorings of planar graphs with maximum degree at least nine (Q764891) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- Equitable list colorings of planar graphs without short cycles (Q954980) (← links)
- A note on equitable colorings of forests (Q1024272) (← links)
- Equitable and proportional coloring of trees (Q1171064) (← links)
- A sufficient condition for equitable edge-colourings of simple graphs (Q1322183) (← links)
- Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Virtually fibering random right-angled Coxeter groups -- extended abstract (Q1792110) (← links)
- Equitable coloring of some convex polytope graphs (Q1794705) (← links)
- On equitable coloring of bipartite graphs (Q1916388) (← links)
- Equitable colorings of planar graphs without short cycles (Q1929237) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- Equivalence of two conjectures on equitable coloring of graphs (Q1956256) (← links)
- Equitable partition of planar graphs (Q2022132) (← links)
- A note on the equitable choosability of complete bipartite graphs (Q2042622) (← links)
- Equitable total coloring of corona of cubic graphs (Q2042627) (← links)
- On list equitable total colorings of the generalized theta graph (Q2042636) (← links)
- Proportional 2-choosability with a bounded palette (Q2071248) (← links)
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075) (← links)
- On the equitable choosability of the disjoint union of stars (Q2084783) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Improving lower bounds for equitable chromatic number (Q2147053) (← links)
- Equitable distinguishing chromatic number (Q2147524) (← links)
- A simple characterization of proportionally 2-choosable graphs (Q2175799) (← links)
- Equitable partitions into matchings and coverings in mixed graphs (Q2237227) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
