scientific article; zbMATH DE number 1303205

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/0930.03050" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q4249728" rel="nofollow">MaRDI QID Q4249728</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q4249728" rel="nofollow">FDO</a>

Authors H. A. Kierstead

Publication date 17 June 1999

zbMATH Keywords

surveyrecursive coloringson-line coloring of graphsrecursive \(k\)-colorable graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Coloring of graphs and hypergraphs (05C15) Theory of numerations, effectively presented structures (03D45)

Recommendations

• On-Line Coloring and Recursive Graph Theory
• On-line coloring \(k\)-colorable graphs
• scientific article; zbMATH DE number 65699
• Coloring inductive graphs on-line
• On-line P-coloring of graphs
• scientific article; zbMATH DE number 524128
• On-line coloring of perfect graphs
• Parallel and On-Line Graph Coloring
• Randomized online graph coloring
• On-line DP-coloring of graphs

Cited in

(19)

• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• scientific article; zbMATH DE number 3900785 (Why is no real title available?)
• An on-line competitive algorithm for coloring \(P_8\)-free bipartite graphs
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Non-density in punctual computability
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Online promise problems with online width metrics
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
• Online coloring of bipartite graphs with and without advice
• Reverse mathematics and Grundy colorings of graphs
• Graphs are not universal for online computability
• Online graph coloring against a randomized adversary
• An on-line competitive algorithm for coloring bipartite graphs without long induced paths
• Radius two trees specify χ‐bounded classes
• Radius two trees specify χ‐bounded classes
• scientific article; zbMATH DE number 7407778 (Why is no real title available?)
• Randomized online graph coloring
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
• Feasible Graphs and Colorings

This page was built for publication:

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