| Publication | Date of Publication | Type |
|---|
Equitable list coloring of sparse graphs
Discrete Mathematics | 2026-02-16 | Paper |
Equitable list coloring of planar graphs with given maximum degree
Journal of Graph Theory | 2025-03-20 | Paper |
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
Discrete Mathematics | 2023-11-27 | Paper |
3‐Degenerate induced subgraph of a planar graph
Journal of Graph Theory | 2023-10-04 | Paper |
| Equitable list coloring of planar graphs with given maximum degree | 2023-09-02 | Paper |
Improved upper bounds on longest-path and maximal-subdivision transversals
Discrete Mathematics | 2023-06-12 | Paper |
Coloring number and on-line Ramsey theory for graphs and hypergraphs
Combinatorica | 2022-06-29 | Paper |
On the weak 2-coloring number of planar graphs
Discrete Mathematics | 2021-10-27 | Paper |
Every planar graph is 1-defective \((9,2)\)-paintable
Discrete Applied Mathematics | 2021-03-17 | Paper |
Uniform orderings for generalized coloring numbers
European Journal of Combinatorics | 2021-02-08 | Paper |
On coloring numbers of graph powers
Discrete Mathematics | 2020-04-21 | Paper |
Improved lower bounds on the number of edges in list critical and online list critical graphs
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
| An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles | 2019-07-25 | Paper |
Chromatic numbers of exact distance graphs
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
Chromatic numbers of exact distance graphs
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
An easy subexponential bound for online chain partitioning
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
An easy subexponential bound for online chain partitioning
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A sharp Dirac-Erdős type bound for large graphs
Combinatorics, Probability and Computing | 2018-04-23 | Paper |
The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles
Combinatorica | 2018-03-16 | Paper |
Sharpening an ore-type version of the Corrádi-Hajnal theorem
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 2018-01-05 | Paper |
Extracting List colorings from large independent sets
Journal of Graph Theory | 2017-12-01 | Paper |
An extension of the Hajnal-Szemerédi theorem to directed graphs
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
Journal of Graph Theory | 2017-08-10 | Paper |
A refinement of a result of Corrádi and Hajnal
Combinatorica | 2017-03-31 | Paper |
On the Corrádi-Hajnal theorem and a question of Dirac
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
On the choice number of complete multipartite graphs with part size four
European Journal of Combinatorics | 2016-08-16 | Paper |
First-fit coloring on interval graphs has performance ratio at least 5
European Journal of Combinatorics | 2015-09-30 | Paper |
Edge coloring multigraphs without small dense subsets
Discrete Mathematics | 2015-08-05 | Paper |
On choosability with separation of planar graphs with lists of different sizes
Discrete Mathematics | 2015-06-01 | Paper |
| scientific article; zbMATH DE number 6399332 (Why is no real title available?) | 2015-02-09 | Paper |
On directed versions of the Corrádi-Hajnal corollary
European Journal of Combinatorics | 2014-09-04 | Paper |
Equitable list coloring of graphs with bounded degree
Journal of Graph Theory | 2013-11-15 | Paper |
A note on relaxed equitable coloring of graphs
Information Processing Letters | 2013-04-04 | Paper |
On First-Fit coloring of ladder-free posets
European Journal of Combinatorics | 2012-12-03 | Paper |
Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
Journal of Graph Theory | 2012-09-12 | Paper |
Adapted game colouring of graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup>
Random Structures & Algorithms | 2012-04-24 | Paper |
Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
Combinatorica | 2011-07-22 | Paper |
A fast algorithm for equitable coloring
Combinatorica | 2011-04-26 | Paper |
First-fit coloring of bounded tolerance graphs
Discrete Applied Mathematics | 2011-04-19 | Paper |
2-factors of bipartite graphs with asymmetric minimum degrees
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
The two-coloring number and degenerate colorings of planar graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
| The game of arboricity | 2010-07-30 | Paper |
| On-line Ramsey numbers for paths and stars | 2010-07-27 | Paper |
Planar graphs are 1-relaxed, 4-choosable
European Journal of Combinatorics | 2010-06-17 | Paper |
| Toward a Hajnal-Szemeredi theorem for hypergraphs | 2010-05-21 | Paper |
Efficient graph packing via game colouring
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
| Extremal graph packing problems: Ore-type versus Dirac-type | 2010-01-13 | Paper |
Ore-type versions of Brooks' theorem
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
Star coloring bipartite planar graphs
Journal of Graph Theory | 2009-02-20 | Paper |
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
Combinatorics, Probability and Computing | 2008-07-21 | Paper |
The Map-Coloring Game
The American Mathematical Monthly | 2008-03-20 | Paper |
The game of arboricity
Discrete Mathematics | 2008-03-18 | Paper |
Asymmetric marking games on line graphs
Discrete Mathematics | 2008-03-13 | Paper |
An Ore-type theorem on equitable coloring
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
Dominating sets in \(k\)-majority tournaments.
Journal of Combinatorial Theory. Series B | 2006-05-18 | Paper |
Weak acyclic coloring and asymmetric coloring games
Discrete Mathematics | 2006-05-16 | Paper |
Very asymmetric marking games
Order | 2006-05-02 | Paper |
Asymmetric graph coloring games
Journal of Graph Theory | 2005-04-21 | Paper |
Radius Three Trees in Graphs with Large Chromatic Number
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Explicit 2-factorizations of the odd graph
Order | 2005-02-25 | Paper |
Coloring with no 2-colored \(P_4\)'s
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Coloring with no 2-colored \(P_4\)'s
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
On-line Ramsey theory
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
On-line Ramsey theory
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
A simple competitive graph coloring algorithm. III
Journal of Combinatorial Theory. Series B | 2004-10-01 | Paper |
Orderings on graphs and game coloring number
Order | 2004-08-06 | Paper |
The relaxed game chromatic number of outerplanar graphs
Journal of Graph Theory | 2004-08-06 | Paper |
A simple competitive graph coloring algorithm. II.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
Marking games and the oriented game chromatic number of partial k-trees
Graphs and Combinatorics | 2003-07-08 | Paper |
2-factors in dense bipartite graphs
Discrete Mathematics | 2002-12-02 | Paper |
A note on graph pebbling
Graphs and Combinatorics | 2002-07-29 | Paper |
Spanning trees of bounded degree
The Electronic Journal of Combinatorics | 2001-12-11 | Paper |
Spanning trees of bounded degree
The Electronic Journal of Combinatorics | 2001-12-11 | Paper |
Competitive colorings of oriented graphs
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
Competitive colorings of oriented graphs
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
On the choosability of complete multipartite graphs with part size three
Discrete Mathematics | 2000-09-15 | Paper |
Extending partial colorings of graphs
Discrete Mathematics | 2000-09-15 | Paper |
A simple competitive graph coloring algorithm
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
Interval orders and dimension
Discrete Mathematics | 2000-03-21 | Paper |
| Onk-ordered Hamiltonian graphs | 1999-11-23 | Paper |
| Hamiltonian chains in hypergraphs | 1999-11-03 | Paper |
The dimension of two levels of the Boolean lattice
Discrete Mathematics | 1999-09-12 | Paper |
| scientific article; zbMATH DE number 1303205 (Why is no real title available?) | 1999-06-17 | Paper |
On-line coloring \(k\)-colorable graphs
Israel Journal of Mathematics | 1999-03-18 | Paper |
Square Hamiltonian cycles in graphs with maximal 4-cliques
Discrete Mathematics | 1998-06-22 | Paper |
Classes of Graphs that Are Not Vertex Ramsey
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
On-line coloring of perfect graphs
Combinatorica | 1998-01-11 | Paper |
Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
Combinatorica | 1998-01-11 | Paper |
The dimension of the finite subsets of
Order | 1997-06-30 | Paper |
| scientific article; zbMATH DE number 975418 (Why is no real title available?) | 1997-03-09 | Paper |
| Partitioning a graph into two square-cycles | 1996-12-16 | Paper |
Hamiltonian square-paths
Journal of Combinatorial Theory. Series B | 1996-10-14 | Paper |
Applications of hypergraph coloring to coloring graphs not inducing certain trees
Discrete Mathematics | 1996-09-01 | Paper |
On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
SIAM Journal on Discrete Mathematics | 1996-06-05 | Paper |
Coloring interval graphs with First-Fit
Discrete Mathematics | 1996-05-13 | Paper |
| scientific article; zbMATH DE number 867638 (Why is no real title available?) | 1996-04-22 | Paper |
On the order dimension of 1-sets versus k-sets
Journal of Combinatorial Theory. Series A | 1996-03-31 | Paper |
The square of paths and cycles
Journal of Combinatorial Theory. Series B | 1995-07-02 | Paper |
Radius two trees specify χ‐bounded classes
Journal of Graph Theory | 1995-03-20 | Paper |
The dimension of suborders of the Boolean lattice
Order | 1994-11-27 | Paper |
Radius two trees specify χ‐bounded classes
Journal of Graph Theory | 1994-10-20 | Paper |
An explicit 1-factorization in the middle of the Boolean lattice
Journal of Combinatorial Theory. Series A | 1994-09-07 | Paper |
| scientific article; zbMATH DE number 431513 (Why is no real title available?) | 1994-07-24 | Paper |
On-Line Coloring and Recursive Graph Theory
SIAM Journal on Discrete Mathematics | 1994-04-19 | Paper |
| scientific article; zbMATH DE number 426348 (Why is no real title available?) | 1993-11-07 | Paper |
| scientific article; zbMATH DE number 398953 (Why is no real title available?) | 1993-08-25 | Paper |
The dimension of cycle-free orders
Order | 1993-06-29 | Paper |
Colorful induced subgraphs
Discrete Mathematics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 65699 (Why is no real title available?) | 1992-09-27 | Paper |
Fibres and ordered set coloring
Journal of Combinatorial Theory. Series A | 1992-06-26 | Paper |
The dimension of random ordered sets
Random Structures & Algorithms | 1992-06-25 | Paper |
A polynomial time approximation algorithm for dynamic storage allocation
Discrete Mathematics | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4168729 (Why is no real title available?) | 1989-01-01 | Paper |
| Hypergraphs With Finitely Many Isomorphism Subtypes | 1989-01-01 | Paper |
The number of depth-first searches of an ordered set
Order | 1989-01-01 | Paper |
Applications of edge coloring of multigraphs to vertex coloring of graphs
Discrete Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4067693 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4097150 (Why is no real title available?) | 1988-01-01 | Paper |
The Linearity of First-Fit Coloring of Interval Graphs
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Explicit matchings in the middle levels of the Boolean lattice
Order | 1988-01-01 | Paper |
A minimax theorem for chain complete ordered sets
Order | 1988-01-01 | Paper |
On <i>Π</i><sub>1</sub>-automorphisms of recursive linear orders
Journal of Symbolic Logic | 1987-01-01 | Paper |
A Ramsey theoretic problem for finite ordered sets
Discrete Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3993569 (Why is no real title available?) | 1986-01-01 | Paper |
NP-completeness results concerning greedy and super greedy linear extensions
Order | 1986-01-01 | Paper |
The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
Discrete Mathematics | 1986-01-01 | Paper |
| Degrees of Indiscernibles in Decidable Models | 1985-01-01 | Paper |
Inequalities for the greedy dimensions of ordered sets
Order | 1985-01-01 | Paper |
A theory of recursive dimension of ordered sets
Order | 1984-01-01 | Paper |
On the chromatic index of multigraphs without large triangles
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
A new method of proving theorems on chromatic index
Discrete Mathematics | 1984-01-01 | Paper |
Indiscernibles and decidable models
Journal of Symbolic Logic | 1983-01-01 | Paper |
Some applications of Vizing's theorem to vertex colorings of graphs
Discrete Mathematics | 1983-01-01 | Paper |
An Effective Version of Hall's Theorem
Proceedings of the American Mathematical Society | 1983-01-01 | Paper |
An Effective Version of Dilworth's Theorem
Transactions of the American Mathematical Society | 1981-01-01 | Paper |
Recursive Colorings of Highly Recursive Graphs
Canadian Journal of Mathematics | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3769624 (Why is no real title available?) | 1981-01-01 | Paper |
Countable models of ω1-categorical theories in admissible languages
Annals of Mathematical Logic | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3646983 (Why is no real title available?) | 1979-01-01 | Paper |
