An Effective Version of Dilworth's Theorem

Cited in

(35)

Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
On-line dimension for posets excluding two long incomparable chains
A structure of punctual dimension two
First-fit coloring of bounded tolerance graphs
On-line algorithms for orders
An on-line graph coloring algorithm with sublinear performance ratio
A subexponential upper bound for the on-line chain partitioning problem
Variations of statement, variations of strength. The case of the Rival-Sands theorems
On-line chain partitions of orders: a survey
Improved lower bounds on the on-line chain partitioning of posets of bounded dimension
Improved lower bound on the on-line chain partitioning of semi-orders with representation
An easy subexponential bound for online chain partitioning
On-line scheduling of jobs with fixed start and end times
On-line algorithms for ordered sets and comparability graphs
On the strength of König's duality theorem for infinite bipartite graphs
Primitive recursive reverse mathematics
On-line chain partitions of orders
The online graph bandwidth problem
Graphs are not universal for online computability
Online presentations of finitely generated structures
Punctual definability on structures
Lower bounds for randomized algorithms for online chain partitioning
On-line chain partitions of up-growing semi-orders
On-line dimension of semi-orders
On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
Coloring interval graphs with First-Fit
A theory of recursive dimension of ordered sets
On-line chain partitioning of up-growing interval orders
(EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE
A structure theory for ordered sets
Binary subtrees with few labeled paths
Forbidden structures for efficient first-fit chain partitioning (extended abstract)
scientific article; zbMATH DE number 7407778 (Why is no real title available?)
FOUNDATIONS OF ONLINE STRUCTURE THEORY
On the complexity of finding the chromatic number of a recursive graph. I: The bounded case

This page was built for publication: An Effective Version of Dilworth's Theorem

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