Point partition numbers: Decomposable and indecomposable critical graphs | 0 | 0.34 | 2022 |
DIGRAPHS AND VARIABLE DEGENERACY | 0 | 0.34 | 2022 |
Vertex Partition Of Hypergraphs And Maximum Degenerate Subhypergraphs | 0 | 0.34 | 2021 |
The Minimum Number of Edges in 4-Critical Digraphs of Given Order | 0 | 0.34 | 2020 |
Hajós and Ore Constructions for Digraphs. | 0 | 0.34 | 2020 |
Partitions of multigraphs under minimum degree constraints | 0 | 0.34 | 2019 |
Graph Edge Coloring: A Survey. | 1 | 0.38 | 2019 |
A Brooks Type Theorem for the Maximum Local Edge Connectivity. | 0 | 0.34 | 2018 |
Degree choosable signed graphs | 0 | 0.34 | 2017 |
Horst Sachs (1927-2016). | 0 | 0.34 | 2017 |
A Relaxed Version of the Erdős-Lovász Tihany Conjecture. | 3 | 0.49 | 2017 |
Orientations of Graphs with Prescribed Weighted Out-Degrees | 0 | 0.34 | 2015 |
The Maximum Chromatic Index of Multigraphs with Given Δ and μ. | 0 | 0.34 | 2012 |
Ohba's conjecture for graphs with independence number five | 5 | 0.47 | 2011 |
Vizing's coloring algorithm and the fan number | 0 | 0.34 | 2010 |
Graphs with bounded tree-width and large odd-girth are almost bipartite | 1 | 0.34 | 2010 |
Edge colouring by total labellings | 7 | 0.75 | 2010 |
On Vizing's bound for the chromatic index of a multigraph | 7 | 0.59 | 2009 |
On list critical graphs | 0 | 0.34 | 2009 |
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs | 8 | 1.68 | 2009 |
The Erdős-Lovász Tihany conjecture for quasi-line graphs | 3 | 0.53 | 2009 |
List colorings with measurable sets | 0 | 0.34 | 2008 |
Ordered and linked chordal graphs. | 1 | 0.36 | 2008 |
A map colour theorem for the union of graphs | 3 | 0.50 | 2006 |
Nordhaus–Gaddum-type Theorems for decompositions into many parts | 14 | 1.06 | 2005 |
On graphs with strongly independent color-classes | 16 | 1.42 | 2004 |
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs | 3 | 0.41 | 2004 |
On a special case of Hadwiger's conjecture. | 20 | 1.69 | 2003 |
A new lower bound on the number of edges in colour-critical graphs and hypergraphs | 14 | 1.15 | 2003 |
A list version of Dirac's theorem on the number of edges in colour-critical graphs | 9 | 0.83 | 2002 |
On the Number of Edges in Colour-Critical Graphs and Hypergraphs | 9 | 1.20 | 2000 |
Decomposing graphs under degree constraints | 35 | 2.47 | 1996 |
An abstract generalization of a map reduction theorem of Birkhoff | 1 | 0.48 | 1995 |
The forest plus stars colouring problem. | 3 | 1.42 | 1994 |
A solution to a colouring problem of P. Erdős | 16 | 2.37 | 1992 |
An historical note: Euler''s K篓onigsberg letters | 3 | 0.53 | 1988 |
K-5 Is The Only Double-Critical 5-Chromatic Graph | 12 | 1.98 | 1987 |
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs | 13 | 2.24 | 1982 |