Effective Matchmaking and k-Chromatic Graphs

DOI10.2307/2039650zbMath0274.02018OpenAlexW4240235823MaRDI QIDQ5181352

Alfred B. Manaster, Joseph G. Rosenstein

Publication date: 1973

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2039650

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Applications of computability and recursion theory (03D80) Algorithms in computer science (68W99)

Related Items

Unbounded search and recursive graph problems, Binary search and recursive graph problems, Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes, Connected components of graphs and reverse mathematics, On the complexity of finding the chromatic number of a recursive graph. I: The bounded case, Recursive Euler and Hamilton Paths