Michael Stiebitz

Discret. Math., November, 2023

Minimum number of arcs in k-critical digraphs with order at most 2k-1.

[BibT_eX]

[DOI]

Lucas Picasarri-Arrieta

CoRR, 2023

2022

Digraphs and Variable Degeneracy.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

SIAM J. Discret. Math., 2022

Point Partition Numbers: Perfect Graphs.

[BibT_eX]

[DOI]

Justus von Postel

Graphs Comb., 2022

Point partition numbers: Decomposable and indecomposable critical graphs.

[BibT_eX]

[DOI]

Justus von Postel

Discret. Math., 2022

2021

Partitions of hypergraphs under variable degeneracy constraints.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Vertex partition of hypergraphs and maximum degenerate subhypergraphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2021

2020

On DP-coloring of digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

The Minimum Number of Edges in 4-Critical Digraphs of Given Order.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Hajós and Ore Constructions for Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Graph Edge Coloring: A Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Partitions of multigraphs under minimum degree constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

A Brooks Type Theorem for the Maximum Local Edge Connectivity.

[BibT_eX]

[DOI]

Bjarne Toft

Electron. J. Comb., 2018

2017

A Relaxed Version of the Erdős-Lovász Tihany Conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Degree choosable signed graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Horst Sachs (1927-2016).

[BibT_eX]

[DOI]

Discret. Math., 2017

2015

Orientations of Graphs with Prescribed Weighted Out-Degrees.

[BibT_eX]

[DOI]

Zsolt Tuza

Margit Voigt

Graphs Comb., 2015

2013

Some Remarks on the Cycle Plus Triangles Problem.

[BibT_eX]

[DOI]

Herbert Fleischner

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

The Maximum Chromatic Index of Multigraphs with Given Δ and μ.

[BibT_eX]

[DOI]

Diego Scheide

Graphs Comb., 2012

Graphs with chromatic number close to maximum degree.

[BibT_eX]

[DOI]

Landon Rabern

Discret. Math., 2012

2011

Ohba's conjecture for graphs with independence number five.

[BibT_eX]

[DOI]

Douglas R. Woodall

Discret. Math., 2011

2010

Vizing's coloring algorithm and the fan number.

[BibT_eX]

[DOI]

Diego Scheide

J. Graph Theory, 2010

Graphs with bounded tree-width and large odd-girth are almost bipartite.

[BibT_eX]

[DOI]

Daniel Král'

Jean-Sébastien Sereni

J. Comb. Theory, Ser. B, 2010

Edge colouring by total labellings.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.

[BibT_eX]

[DOI]

Daniel Král

Jean-Sébastien Sereni

SIAM J. Discret. Math., 2009

On list critical graphs.

[BibT_eX]

[DOI]

Zsolt Tuza

Margit Voigt

Discret. Math., 2009

On Vizing's bound for the chromatic index of a multigraph.

[BibT_eX]

[DOI]

Diego Scheide

Discret. Math., 2009

The Erdos-Lovász Tihany conjecture for quasi-line graphs.

[BibT_eX]

[DOI]

József Balogh

Noah Prince

Discret. Math., 2009

2008

List colorings with measurable sets.

[BibT_eX]

[DOI]

Jan Hladký

Daniel Král

Jean-Sébastien Sereni

J. Graph Theory, 2008

Ordered and linked chordal graphs.

[BibT_eX]

[DOI]

Thomas Böhme

Tobias Gerlach

Discuss. Math. Graph Theory, 2008

Partitions and Edge Colourings of Multigraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2006

A map colour theorem for the union of graphs.

[BibT_eX]

[DOI]

Riste Skrekovski

J. Comb. Theory, Ser. B, 2006

2005

Nordhaus-Gaddum-type Theorems for decompositions into many parts.

[BibT_eX]

[DOI]

Zoltán Füredi

Riste Skrekovski

Douglas B. West

J. Graph Theory, 2005

Deeply asymmetric planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2005

2004

On graphs with strongly independent color-classes.

[BibT_eX]

[DOI]

András Gyárfás

Tommy Jensen

J. Graph Theory, 2004

Subdivisions of large complete bipartite graphs and long induced paths in <i>k</i>-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

2003

A new lower bound on the number of edges in colour-critical graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2003

On a special case of Hadwiger's conjecture.

[BibT_eX]

[DOI]

Michael D. Plummer

Bjarne Toft

Discuss. Math. Graph Theory, 2003

2002

A list version of Dirac's theorem on the number of edges in colour-critical graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

2000

On the Number of Edges in Colour-Critical Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Comb., 2000

1999

Dirac's map-color theorem for choosability.

[BibT_eX]

[DOI]

Thomas Böhme

Bojan Mohar

J. Graph Theory, 1999

1998

Colour-critical graphs with few edges.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Spanning trees with pairwise nonadjacent endvertices.

[BibT_eX]

[DOI]

Thomas Böhme

Hajo Broersma

F. Göbel

Discret. Math., 1997

1996

Decomposing graphs under degree constraints.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

The colour theorems of Brooks and Gallai extended.

[BibT_eX]

[DOI]

Brunhilde Wirth

Discret. Math., 1996

1995

An Abstract Generalization of a Map Reduction Theorem of Birkhoff.

[BibT_eX]

[DOI]

Bjarne Toft

J. Comb. Theory, Ser. B, 1995

1994

The forest plus stars colouring problem.

[BibT_eX]

[DOI]

Discret. Math., 1994

1992

On the Bandwidth of Graph Products.

[BibT_eX]

U. Hendrich

J. Inf. Process. Cybern., 1992

On Hadwiger's number - a problem of the Nordhaus-Gaddum type.

[BibT_eX]

[DOI]

Discret. Math., 1992

A solution to a colouring problem of P. Erdös.

[BibT_eX]

[DOI]

Herbert Fleischner

Discret. Math., 1992

1989

On constructive methods in the theory of colour-critical graphs.

[BibT_eX]

[DOI]

Horst Sachs

Discret. Math., 1989

1988

An historical note: Euler's Königsberg letters.

[BibT_eX]

[DOI]

Horst Sachs

Robin J. Wilson

J. Graph Theory, 1988

1987

K<sub>5</sub> is the only double-critical 5-chromatic graph.

[BibT_eX]

[DOI]

Discret. Math., 1987

Subgraphs of color-critical graphs.

[BibT_eX]

[DOI]

Comb., 1987

1982

Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs.

[BibT_eX]

[DOI]