| Publication | Date of Publication | Type |
|---|
Comparison of sum choice number with chromatic sum
Discrete Mathematics | 2021-06-14 | Paper |
A note on complex-4-colorability of signed planar graphs
The Electronic Journal of Combinatorics | 2021-05-11 | Paper |
Generalized sum List colorings of graphs
Discussiones Mathematicae Graph Theory | 2019-05-27 | Paper |
Zig-zag facial total-coloring of plane graphs
Opuscula Mathematica | 2018-12-10 | Paper |
A note on not-4-list colorable planar graphs
The Electronic Journal of Combinatorics | 2018-06-14 | Paper |
On the \(\mathcal{P}\)-sum choice number of graphs for \(1\)-additive properties
| 2018-04-23 | Paper |
Bounds for the sum choice number
| 2018-04-10 | Paper |
Sum choice number of generalized \(\theta\)-graphs
Discrete Mathematics | 2017-09-05 | Paper |
Sum list colorings of small graphs
| 2017-04-04 | Paper |
List-colourings
| 2016-09-30 | Paper |
Sum list edge colorings of graphs
Discussiones Mathematicae Graph Theory | 2016-07-13 | Paper |
Facial list colourings of plane graphs
Discrete Mathematics | 2016-07-05 | Paper |
Sum list colorings of products of graphs
Congressus Numerantium | 2016-04-13 | Paper |
A note on adjacent vertex distinguishing colorings of graphs
Discrete Applied Mathematics | 2016-04-07 | Paper |
Sum list colorings of wheels
Graphs and Combinatorics | 2015-12-17 | Paper |
\((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs
Discrete Mathematics | 2015-06-01 | Paper |
Orientations of graphs with prescribed weighted out-degrees
Graphs and Combinatorics | 2015-01-20 | Paper |
Fractional \((\mathcal P, \mathcal Q)\)-total list colorings of graphs
Discussiones Mathematicae. Graph Theory | 2013-12-13 | Paper |
List colorings of \(K_5\)-minor-free graphs with special list assignments
Journal of Graph Theory | 2012-09-12 | Paper |
Weights of induced subgraphs in \(K_{1,r}\)-free graphs
Discrete Mathematics | 2012-08-10 | Paper |
Parity vertex colouring of plane graphs
Discrete Mathematics | 2011-02-18 | Paper |
Precoloring extension for 2-connected graphs with maximum degree three
Discrete Mathematics | 2009-12-15 | Paper |
On list critical graphs
Discrete Mathematics | 2009-12-15 | Paper |
Precoloring extension forK4-minor-free graphs
Journal of Graph Theory | 2009-06-16 | Paper |
Precoloring Extension for 2‐connected Graphs
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Characterization of graphs dominated by induced paths
Discrete Mathematics | 2007-03-02 | Paper |
List colourings of planar graphs. (Reprint)
Discrete Mathematics | 2006-08-04 | Paper |
List version of \(L(d,s)\)-labelings
Theoretical Computer Science | 2006-03-20 | Paper |
scientific article; zbMATH DE number 1953103 (Why is no real title available?)
| 2003-07-25 | Paper |
Distance graphs with finite chromatic number
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
A note on planar 5-list colouring: Non-extendability at distance 4
Discrete Mathematics | 2002-08-29 | Paper |
Oriented list colorings of graphs
Journal of Graph Theory | 2002-08-28 | Paper |
Polyhedral graphs with restricted number of faces of the same type
Discrete Mathematics | 2002-05-21 | Paper |
Colouring of distance graphs
Ars Combinatoria | 2001-12-17 | Paper |
On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs
Journal of Graph Theory | 2001-07-08 | Paper |
On Dominating Sets and Independent Sets of Graphs
Combinatorics, Probability and Computing | 2001-04-20 | Paper |
Algorithmic aspects of partial list colourings
Combinatorics, Probability and Computing | 2001-04-20 | Paper |
Remarks on the existence of uniquely partitionable planar graphs
Discussiones Mathematicae Graph Theory | 2001-04-09 | Paper |
scientific article; zbMATH DE number 1536522 (Why is no real title available?)
| 2000-11-28 | Paper |
On uniquely partitionable planar graphs
Discrete Mathematics | 2000-11-02 | Paper |
Complexity of choosing subsets from color sets
Discrete Mathematics | 2000-11-02 | Paper |
On-line rankings of graphs
Discrete Mathematics | 2000-10-23 | Paper |
scientific article; zbMATH DE number 1341914 (Why is no real title available?)
| 2000-01-03 | Paper |
Brooks-type theorems for choosability with separation
| 1998-09-07 | Paper |
List colorings and reducibility
Discrete Applied Mathematics | 1998-01-28 | Paper |
Choosability and fractional chromatic numbers
Discrete Mathematics | 1997-12-02 | Paper |
Minimal colorings for properly colored subgraphs
Graphs and Combinatorics | 1997-02-11 | Paper |
scientific article; zbMATH DE number 908794 (Why is no real title available?)
| 1996-12-09 | Paper |
Choosability of planar graphs
Discrete Mathematics | 1996-11-25 | Paper |
A not 3-choosable planar graph without 3-cycles
Discrete Mathematics | 1996-08-13 | Paper |
scientific article; zbMATH DE number 889958 (Why is no real title available?)
| 1996-07-23 | Paper |
scientific article; zbMATH DE number 889959 (Why is no real title available?)
| 1996-06-16 | Paper |
Chromatic number of prime distance graphs
Discrete Applied Mathematics | 1995-03-09 | Paper |
List colourings of planar graphs
Discrete Mathematics | 1994-06-22 | Paper |
scientific article; zbMATH DE number 528072 (Why is no real title available?)
| 1994-03-14 | Paper |
scientific article; zbMATH DE number 57114 (Why is no real title available?)
| 1992-09-27 | Paper |
On the chromatic number of special distance graphs
Discrete Mathematics | 1992-06-28 | Paper |
