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