Margit Voigt

Discret. Math., 2021

A Note on Complex-4-Colorability of Signed Planar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2019

Generalized sum list colorings of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

2018

A Note on Not-4-List Colorable Planar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Bounds for the sum choice number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Sum choice number of generalized θ-graphs.

[BibT_eX]

[DOI]

Christoph Brause

Discret. Math., 2017

2016

Sum list edge colorings of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Facial list colourings of plane graphs.

[BibT_eX]

[DOI]

Igor Fabrici

Stanislav Jendrol'

Discret. Math., 2016

A note on adjacent vertex distinguishing colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Orientations of Graphs with Prescribed Weighted Out-Degrees.

[BibT_eX]

[DOI]

Michael Stiebitz

Graphs Comb., 2015

Sum List Colorings of Wheels.

[BibT_eX]

[DOI]

Graphs Comb., 2015

(P, Q)-Total (r, s)-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

2013

Fractional ( P, Q)-total list colorings of graphs.

[BibT_eX]

[DOI]

Peter Mihók

Discuss. Math. Graph Theory, 2013

2012

List Colorings of K5-Minor-Free Graphs With Special List Assignments.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Weights of induced subgraphs in K1, r-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Parity vertex colouring of plane graphs.

[BibT_eX]

[DOI]

Július Czap

Stanislav Jendrol'

Discret. Math., 2011

2009

Precoloring extension for K4-minor-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Precoloring extension for 2-connected graphs with maximum degree three.

[BibT_eX]

[DOI]

Discret. Math., 2009

On list critical graphs.

[BibT_eX]

[DOI]

Michael Stiebitz

Discret. Math., 2009

2007

Precoloring Extension for 2-connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

A non-3-choosable planar graph without cycles of length 4 and 5.

[BibT_eX]

[DOI]

Discret. Math., 2007

Characterization of graphs dominated by induced paths.

[BibT_eX]

[DOI]

Gábor Bacsó

Discret. Math., 2007

2005

List version of L(d, s)-labelings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2002

Distance Graphs with Finite Chromatic Number.

[BibT_eX]

[DOI]

Imre Z. Ruzsa

J. Comb. Theory, Ser. B, 2002

Preface.

[BibT_eX]

[DOI]

Jochen Harant

Ingo Schiermeyer

Discuss. Math. Graph Theory, 2002

Polyhedral graphs with restricted number of faces of the same type.

[BibT_eX]

[DOI]

Hansjoachim Walther

Discret. Math., 2002

A note on planar 5-list colouring: non-extendability at distance 4.

[BibT_eX]

[DOI]

Discret. Math., 2002

On the b-Chromatic Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

Oriented list colorings of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

On weights of induced paths and cycles in claw-free and K1, r-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

2000

On-line rankings of graphs.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Discret. Math., 2000

Algorithmic Aspects Of Partial List Colourings.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

1999

Remarks on the existence of uniquely partitionable planar graphs.

[BibT_eX]

[DOI]

Mieczyslaw Borowiecki

Peter Mihók

Discuss. Math. Graph Theory, 1999

On Dominating Sets And Independent Sets Of Graphs.

[BibT_eX]

[DOI]

Jochen Harant

Comb. Probab. Comput., 1999

Colouring of distance graphs.

[BibT_eX]

Ars Comb., 1999

1998

Brooks-type theorems for choosability with separation.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

On uniquely partitionable planar graphs.

[BibT_eX]

[DOI]

Peter Mihók

Jozef Bucko

Discret. Math., 1998

Complexity of choosing subsets from color sets.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

On 3-colorable non-4-choosable planar graphs.

[BibT_eX]

[DOI]

Brunhilde Wirth

J. Graph Theory, 1997

Choosability and fractional chromatic numbers.

[BibT_eX]

[DOI]

Noga Alon

Discret. Math., 1997

List Colorings and Reducibility.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

New trends in the theory of graph colorings: Choosability and list coloring.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Every 2-choosable graph is (2m, m)-choosable.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Minimal colorings for properly colored subgraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1996

Choosability of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

A not 3-choosable planar graph without 3-cycles.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Chromatic Number of Prime Distance Graphs.

[BibT_eX]

[DOI]

Hansjoachim Walther

Discret. Appl. Math., 1994

1993

List colourings of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

On the Chromatic Number of Distance Graphs.

[BibT_eX]

J. Inf. Process. Cybern., 1992

1991

On the chromatic number of special distance graphs.

[BibT_eX]

[DOI]