Perfect Graphs and an Application to Optimizing Municipal Services

From MaRDI portal
Publication:5668500

DOI10.1137/1015072zbMath0255.05111OpenAlexW1971010556MaRDI QIDQ5668500

Alan C. Tucker

Publication date: 1973

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1015072




Related Items

Equitable chromatic number of weak modular product of Some graphsImproving lower bounds for equitable chromatic numberEvery 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-ColoringA DSATUR-based algorithm for the equitable coloring problemA Tabu Search Heuristic for the Equitable Coloring ProblemProportional choosability of complete bipartite graphsEquitable colorings of Kronecker products of graphsA simple characterization of proportionally 2-choosable graphs\((N, p)\)-equitable \(b\)-coloring of graphsA Short Proof of the Hajnal–Szemerédi Theorem on Equitable ColouringA polyhedral approach for the equitable coloring problemA flow based pruning scheme for enumerative equitable coloring algorithmsThe equitable vertex arboricity of complete tripartite graphsA branch-and-cut algorithm for the equitable coloring problem using a formulation by representativesColoring the square of Sierpiński graphsA refinement of a result of Corrádi and HajnalTotal equitable list coloringA fast algorithm for equitable coloringOn the equitable vertex arboricity of graphsUnnamed ItemEquitable versus nearly equitable coloring and the Chen-Lih-Wu ConjectureOn the chromatic number of graphsOn the equitable vertex arboricity of complete tripartite graphsEquitable coloring of some convex polytope graphsA note on the equitable choosability of complete bipartite graphsOn list equitable total colorings of the generalized theta graphEquitable coloring of Kronecker products of complete multipartite graphs and complete graphsEquitable list coloring and treewidthEquitable defective coloring of sparse planar graphsEquitable colorings of Cartesian products of graphsAn algorithm for colouring perfect planar graphsProportional 2-choosability with a bounded paletteProportional choosability: a new list analogue of equitable coloringA Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by RepresentativesOn the equitable choosability of the disjoint union of starsEquitable List Coloring of Graphs with Bounded DegreeOn equitable \(\Delta\)-coloring of graphs with low average degree