Effective Matchmaking and k-Chromatic Graphs

DOI10.2307/2039650MaRDI QIDQ5181352zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(6)

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

This page was built for publication: Effective Matchmaking and k-Chromatic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5181352)