Effective coloration - MaRDI portal

Cited in

(43)

An on-line graph coloring algorithm with sublinear performance ratio
The Mapmaker's dilemma
Hamiltonian paths in infinite graphs
The online graph bandwidth problem
On the finiteness of the recursive chromatic number
Index sets for ^0_1 classes
Lower bounds for on-line graph coloring
On-line coloring of perfect graphs
Binary search and recursive graph problems
On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
Online independent sets.
On-line algorithms for ordered sets and comparability graphs
Tight bounds for online coloring of basic graph classes
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
A theory of recursive dimension of ordered sets
R.e. Prime powers and total rigidity
Prime labelings of infinite graphs
Domatic partitions of computable graphs
On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
A coloring problem for weighted graphs
Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
Recursive Euler and Hamilton Paths
1994 Annual Meeting of the Association for Symbolic Logic
Online coloring of bipartite graphs with and without advice
Computing planarity in computable planar graphs
Unbounded search and recursive graph problems
Tight bounds for online coloring of basic graph classes
Foundations of online structure theory. II: The operator approach
Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
Online coloring and a new type of adversary for online graph problems
Recursive coloration of countable graphs
Max-coloring of vertex-weighted graphs
Online coloring and a new type of adversary for online graph problems
Online coloring of short intervals
Periodic colorings and orientations in infinite graphs
Tree coloring with predictions
Dynamic coloring of unit interval graphs with limited recourse budget
Computable vs descriptive combinatorics of local problems on trees
Paths, ends and the separation problem for infinite graphs
First-fit coloring of forests in random arrival model
Finding domatic partitions in infinite graphs
\(A\)-computable graphs
On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case

This page was built for publication: Effective coloration

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