Perfect Graphs and an Application to Optimizing Municipal Services
From MaRDI portal
Cited in
(40)- \((N, p)\)-equitable \(b\)-coloring of graphs
- A flow based pruning scheme for enumerative equitable coloring algorithms
- Total equitable list coloring
- Equitable coloring of some convex polytope graphs
- An algorithm for colouring perfect planar 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
- Proportional choosability: a new list analogue of equitable coloring
- A polyhedral approach for the equitable coloring problem
- Proportional choosability of complete bipartite graphs
- On the equitable vertex arboricity of complete tripartite graphs
- A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
- Equitable list coloring of graphs with bounded degree
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- A tabu search heuristic for the equitable coloring problem
- A DSATUR-based algorithm for the equitable coloring problem
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Equitable list coloring and treewidth
- The equitable vertex arboricity of complete tripartite graphs
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Coloring the square of Sierpiński graphs
- Equitable chromatic number of weak modular product of some graphs
- On equitable coloring of extented corona of some graphs
- A refinement of a result of Corrádi and Hajnal
- A fast algorithm for equitable coloring
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- On the equitable vertex arboricity of graphs
- On the chromatic number of graphs
- Equitable colorings of Kronecker products of graphs
- Integral sum graphs G n and G -r,n are perfect graphs
- Equitable list coloring of sparse graphs
- Equitable coloring of graphs beyond planarity
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable defective coloring of sparse planar graphs
- Equitable colorings of Cartesian products of graphs
- On equitable -coloring of graphs with low average degree
This page was built for publication: Perfect Graphs and an Application to Optimizing Municipal Services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668500)