scientific article; zbMATH DE number 1303205
From MaRDI portal
Publication:4249728
zbMath0930.03050MaRDI QIDQ4249728
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items
Online Graph Coloring Against a Randomized Adversary, Radius two trees specify χ‐bounded classes, Online promise problems with online width metrics, An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs, Radius two trees specify χ‐bounded classes, Graphs are not universal for online computability, Online coloring of bipartite graphs with and without advice, An on-line competitive algorithm for coloring bipartite graphs without long induced paths, Reverse Mathematics and Grundy colorings of graphs, Non-density in punctual computability, FOUNDATIONS OF ONLINE STRUCTURE THEORY, Unnamed Item, PUNCTUAL CATEGORICITY AND UNIVERSALITY