Completing Colored Graphs to Meet a Target Property

DOI10.1007/978-3-642-45043-3_17zbMath1417.05062OpenAlexW105176487MaRDI QIDQ2864301

Kathryn Cook, R. Sritharan, Elaine M. Eschen, Xiaoqiang Wang

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_17

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Completing Colored Graphs to Meet a Target Property