2024
The Alon-Tarsi number of planar graphs revisited.
J. Graph Theory, March, 2024
2023
Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices.
J. Graph Theory, December, 2023
The circular chromatic number of signed series-parallel graphs of given girth.
Discret. Appl. Math., December, 2023
2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs.
Graphs Comb., October, 2023
Refined List Version of Hadwiger's Conjecture.
SIAM J. Discret. Math., September, 2023
Girth and λ $\lambda $-choosability of graphs.
J. Graph Theory, July, 2023
Decomposition of planar graphs with forbidden configurations.
Discret. Appl. Math., May, 2023
The strong fractional choice number of 3-choice-critical graphs.
J. Graph Theory, 2023
List 4-colouring of planar graphs.
J. Comb. Theory, Ser. B, 2023
Weak (2,3)-Decomposition of Planar Graphs.
Electron. J. Comb., 2023
Weak Degeneracy of Planar Graphs and Locally Planar Graphs.
Electron. J. Comb., 2023
2022
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs.
SIAM J. Discret. Math., December, 2022
Signed colouring and list colouring of k-chromatic graphs.
J. Graph Theory, 2022
3-Degenerate induced subgraph of a planar graph.
J. Graph Theory, 2022
Decomposing planar graphs into graphs with degree restrictions.
J. Graph Theory, 2022
Every nice graph is (1, 5)-choosable.
J. Comb. Theory, Ser. B, 2022
Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles.
Graphs Comb., 2022
The circular chromatic numbers of signed series-parallel graphs.
Discret. Math., 2022
Signed planar graphs with given circular chromatic numbers.
Discret. Math., 2022
Generalized signed graphs of large girth and large chromatic number.
Discret. Math., 2022
The Fractional Chromatic Number of Generalized Cones over Graphs.
Electron. J. Comb., 2022
Dense Eulerian Graphs are $(1, 3)$-Choosable.
Electron. J. Comb., 2022
2021
Chromatic λ-choosable and λ-paintable graphs.
J. Graph Theory, 2021
Relatively small counterexamples to Hedetniemi's conjecture.
J. Comb. Theory, Ser. B, 2021
Generalized List Colouring of Graphs.
Graphs Comb., 2021
Total weight choosability for Halin graphs.
Electron. J. Graph Theory Appl., 2021
Colouring of S-labelled planar graphs.
Eur. J. Comb., 2021
Every planar graph is 1-defective (9, 2)-paintable.
Discret. Appl. Math., 2021
Circular Chromatic Number of Signed Graphs.
Electron. J. Comb., 2021
2020
Multiple list coloring of 3-choice critical graphs.
J. Graph Theory, 2020
List coloring triangle-free planar graphs.
J. Graph Theory, 2020
Fractional DP-colorings of sparse graphs.
J. Graph Theory, 2020
The Alon-Tarsi number of a planar graph minus a matching.
J. Comb. Theory, Ser. B, 2020
A refinement of choosability of graphs.
J. Comb. Theory, Ser. B, 2020
The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l.
Discret. Math., 2020
The strong fractional choice number of series-parallel graphs.
Discret. Math., 2020
On-line DP-coloring of graphs.
Discret. Appl. Math., 2020
A note about online nonrepetitive coloring k-trees.
Discret. Appl. Math., 2020
A connected version of the graph coloring game.
Discret. Appl. Math., 2020
A Note on the Poljak-Rödl Function.
Electron. J. Comb., 2020
Clustering Powers of Sparse Graphs.
Electron. J. Comb., 2020
$4$-Colouring of Generalized Signed Planar Graphs.
Electron. J. Comb., 2020
2019
The Alon-Tarsi number of planar graphs.
J. Comb. Theory, Ser. B, 2019
Multiple list colouring triangle free planar graphs.
J. Comb. Theory, Ser. B, 2019
Hamiltonian Spectra of Graphs.
Graphs Comb., 2019
Extensions of matroid covering and packing.
Eur. J. Comb., 2019
Colouring of generalized signed triangle-free planar graphs.
Discret. Math., 2019
Graphs are (1, Δ+1)-choosable.
Discret. Math., 2019
Extremal problems on saturation for the family of k-edge-connected graphs.
Discret. Appl. Math., 2019
A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function.
Electron. J. Comb., 2019
2018
Theor. Comput. Sci., 2018
Completing orientations of partially oriented graphs.
J. Graph Theory, 2018
Greedy Nim<sub>k</sub> Game.
J. Comb. Optim., 2018
Randomly twisted hypercubes.
Eur. J. Comb., 2018
List colouring of graphs and generalized Dyck paths.
Discret. Math., 2018
Graphs with maximum average degree less than 114 are (1, 3)-choosable.
Discret. Math., 2018
Total list weighting of graphs with bounded maximum average degree.
Discret. Math., 2018
The fault-diameter and wide-diameter of twisted hypercubes.
Discret. Appl. Math., 2018
Defective 3-Paintability of Planar Graphs.
Electron. J. Comb., 2018
2017
Total Weight Choosability of Trees.
SIAM J. Discret. Math., 2017
A Hypercube Variant with Small Diameter.
J. Graph Theory, 2017
On (4, 2)-Choosable Graphs.
J. Graph Theory, 2017
Multiple list colouring of planar graphs.
J. Comb. Theory, Ser. B, 2017
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory, Ser. B, 2017
Total weight choosability of Mycielski graphs.
J. Comb. Optim., 2017
DP-colorings of graphs with high chromatic number.
Eur. J. Comb., 2017
Total weight choosability of graphs with bounded maximum average degree.
Discret. Math., 2017
The wide-diameter of Z<sub>n, k</sub>.
Discret. Appl. Math., 2017
Choosability and paintability of the lexicographic product of graphs.
Discret. Appl. Math., 2017
Permanent Index of Matrices Associated with Graphs.
Electron. J. Comb., 2017
2016
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2016
Strong Chromatic Index of Sparse Graphs.
J. Graph Theory, 2016
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions.
J. Graph Theory, 2016
Antimagic Labeling of Regular Graphs.
J. Graph Theory, 2016
A combinatorial proof for the circular chromatic number of Kneser graphs.
J. Comb. Optim., 2016
(2+ϵ)-Nonrepetitive List Colouring of Paths.
Graphs Comb., 2016
Total Weight Choosability of Cone Graphs.
Graphs Comb., 2016
Electron. Notes Discret. Math., 2016
Locally planar graphs are 2-defective 4-paintable.
Eur. J. Comb., 2016
Circular total chromatic numbers of graphs.
Discret. Math., 2016
Fractional Thue chromatic number of graphs.
Discret. Appl. Math., 2016
Every graph is (2, 3)-choosable.
Comb., 2016
2015
Regular Graphs of Odd Degree Are Antimagic.
J. Graph Theory, 2015
Circular flow number of highly edge connected signed graphs.
J. Comb. Theory, Ser. B, 2015
The game Grundy indices of graphs.
J. Comb. Optim., 2015
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.
Eur. J. Comb., 2015
Circular chromatic indices of even degree regular graphs.
Discret. Math., 2015
Locally planar graphs are 5-paintable.
Discret. Math., 2015
Characterization of $(2m, m)$-Paintable Graphs.
Electron. J. Comb., 2015
Maximum 4-Degenerate Subgraph of a Planar Graph.
Electron. J. Comb., 2015
2014
Circular Chromatic Indices of Regular Graphs.
J. Graph Theory, 2014
Antimagic Labeling of Cubic Graphs.
J. Graph Theory, 2014
Colouring edges with many colours in cycles.
J. Comb. Theory, Ser. B, 2014
Towards an on-line version of Ohba's conjecture.
Eur. J. Comb., 2014
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs.
Eur. J. Comb., 2014
Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883].
Eur. J. Comb., 2014
Nonrepetitive colorings of lexicographic product of graphs.
Discret. Math. Theor. Comput. Sci., 2014
Anti-magic labeling of trees.
Discret. Math., 2014
List backbone colouring of graphs.
Discret. Appl. Math., 2014
Lower Bounds for On-line Graph Colorings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
2013
Anti-magic labelling of Cartesian product of graphs.
Theor. Comput. Sci., 2013
Partial Online List Coloring of Graphs.
J. Graph Theory, 2013
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.
J. Graph Theory, 2013
A short proof for Chen's Alternative Kneser Coloring Lemma.
J. Comb. Theory, Ser. A, 2013
The game Grundy number of graphs.
J. Comb. Optim., 2013
Preface: optimization in graphs.
J. Comb. Optim., 2013
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond.
Electron. Notes Discret. Math., 2013
The strong game colouring number of directed graphs.
Discret. Math., 2013
Backbone coloring for graphs with large girths.
Discret. Math., 2013
Beyond Ohba's Conjecture: A bound on the choice number of <i>k</i>-chromatic graphs with <i>n</i> vertices.
CoRR, 2013
2012
The surviving rate of planar graphs.
Theor. Comput. Sci., 2012
Antimagic labelling of vertex weighted graphs.
J. Graph Theory, 2012
Decomposing a graph into forests.
J. Comb. Theory, Ser. B, 2012
Total weight choosability of Cartesian product of graphs.
Eur. J. Comb., 2012
Adapted game colouring of graphs.
Eur. J. Comb., 2012
Application of polynomial method to on-line list colouring of graphs.
Eur. J. Comb., 2012
Weighted-1-antimagic graphs of prime power order.
Discret. Math., 2012
On-Line List Colouring of Complete Multipartite Graphs.
Electron. J. Comb., 2012
2011
The surviving rate of an outerplanar graph for the firefighter problem.
Theor. Comput. Sci., 2011
Nonrepetitive list colourings of paths.
Random Struct. Algorithms, 2011
Total weight choosability of graphs.
J. Graph Theory, 2011
Short cycle covers of graphs and nowhere-zero flows.
J. Graph Theory, 2011
Circular consecutive choosability of <i>k</i>-choosable graphs.
J. Graph Theory, 2011
Entire colouring of plane graphs.
J. Comb. Theory, Ser. B, 2011
Circular flow on signed graphs.
J. Comb. Theory, Ser. B, 2011
The fractional version of Hedetniemi's conjecture is true.
Eur. J. Comb., 2011
Acyclic 4-choosability of planar graphs.
Discret. Math., 2011
Thue choosability of trees.
Discret. Appl. Math., 2011
Towards on-line Ohba's conjecture
CoRR, 2011
Distinguishing labeling of the actions of almost simple groups.
Comb., 2011
Graphs with chromatic numbers strictly less than their colouring numbers.
Ars Math. Contemp., 2011
Complexity of Cycle Transverse Matching Problems.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
2010
Multiple Coloring of Cone Graphs.
SIAM J. Discret. Math., 2010
Multi-coloring the Mycielskian of graphs.
J. Graph Theory, 2010
Choosability of toroidal graphs without short cycles.
J. Graph Theory, 2010
Total coloring of planar graphs of maximum degree eight.
Inf. Process. Lett., 2010
Decomposition of sparse graphs into two forests, one having bounded maximum degree.
Inf. Process. Lett., 2010
Decomposition of sparse graphs, with application to game coloring number.
Discret. Math., 2010
Rainbow domination on trees.
Discret. Appl. Math., 2010
Game Colouring Directed Graphs.
Electron. J. Comb., 2010
2009
The Two-Coloring Number and Degenerate Colorings of Planar Graphs.
SIAM J. Discret. Math., 2009
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three.
SIAM J. Discret. Math., 2009
Adapted list coloring of planar graphs.
J. Graph Theory, 2009
Bipartite subgraphs of triangle-free subcubic graphs.
J. Comb. Theory, Ser. B, 2009
An upper bound on adaptable choosability of graphs.
Eur. J. Comb., 2009
Colouring graphs with bounded generalized colouring number.
Discret. Math., 2009
Distinguishing labeling of group actions.
Discret. Math., 2009
Circular game chromatic number of graphs.
Discret. Math., 2009
Adaptable chromatic number of graph products.
Discret. Math., 2009
Adaptable choosability of planar graphs with sparse short cycles.
Discret. Math., 2009
Game colouring of the square of graphs.
Discret. Math., 2009
Colouring games on outerplanar graphs and trees.
Discret. Math., 2009
Bipartite density of triangle-free subcubic graphs.
Discret. Appl. Math., 2009
On-Line List Colouring of Graphs.
Electron. J. Comb., 2009
2008
Adapted List Coloring of Graphs and Hypergraphs.
SIAM J. Discret. Math., 2008
Game coloring the Cartesian product of graphs.
J. Graph Theory, 2008
Circular chromatic index of Cartesian products of graphs.
J. Graph Theory, 2008
Circular choosability via combinatorial Nullstellensatz.
J. Graph Theory, 2008
Refined activation strategy for the marking game.
J. Comb. Theory, Ser. B, 2008
Activation strategy for asymmetric marking games.
Eur. J. Comb., 2008
Minimal circular-imperfect graphs of large clique number and large independence number.
Eur. J. Comb., 2008
Fractional chromatic number of distance graphs generated by two-interval sets.
Eur. J. Comb., 2008
On the adaptable chromatic number of graphs.
Eur. J. Comb., 2008
The 6-relaxed game chromatic number of outerplanar graphs.
Discret. Math., 2008
Lower bounds for the game colouring number of partial k-trees and planar graphs.
Discret. Math., 2008
Circular Degree Choosability.
Electron. J. Comb., 2008
2007
List circular coloring of trees and cycles.
J. Graph Theory, 2007
The circular chromatic index of graphs of high girth.
J. Comb. Theory, Ser. B, 2007
Claw-free circular-perfect graphs.
Electron. Notes Discret. Math., 2007
Cartesian powers of graphs can be distinguished by two labels.
Eur. J. Comb., 2007
2006
On the circular chromatic number of circular partitionable graphs.
J. Graph Theory, 2006
Uniquely circular colourable and uniquely fractional colourable graphs of large girth.
Contributions Discret. Math., 2006
Relaxed game chromatic number of outer planar graphs.
Ars Comb., 2006
Upper hamiltonian numbers and hamiltonian spectra of graphs.
Australas. J Comb., 2006
The d-relaxed game chromatic index of k-degenerated graphs.
Australas. J Comb., 2006
2005
Resource-sharing system scheduling and circular chromatic number.
Theor. Comput. Sci., 2005
Multilevel Distance Labelings for Paths and Cycles.
SIAM J. Discret. Math., 2005
Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs.
SIAM J. Discret. Math., 2005
Circular choosability of graphs.
J. Graph Theory, 2005
Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" <i>Journal of Graph Theory</i> 47(2) 2004, 129-146.
J. Graph Theory, 2005
Circular chromatic index of graphs of maximum degree 3.
J. Graph Theory, 2005
Graphs of Large Girth with Prescribed Partial Circular Colourings.
Graphs Comb., 2005
Three classes of minimal circular-imperfect graphs.
Electron. Notes Discret. Math., 2005
Coloring the Cartesian Sum of Graphs.
Electron. Notes Discret. Math., 2005
2004
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks.
SIAM J. Discret. Math., 2004
Density of the circular chromatic numbers of series-parallel graphs.
J. Graph Theory, 2004
Fractional chromatic number and circular chromatic number for distance graphs with large clique size.
J. Graph Theory, 2004
On sparse graphs with given colorings and homomorphisms.
J. Comb. Theory, Ser. B, 2004
Sparse <i>H</i>-Colourable Graphs of Bounded Maximum Degree.
Graphs Comb., 2004
Relaxed game chromatic number of trees and outerplanar graphs.
Discret. Math., 2004
Incidence coloring of k-degenerated graphs.
Discret. Math., 2004
2003
Construction of graphs with given circular flow numbers.
J. Graph Theory, 2003
Circular chromatic number and Mycielski construction.
J. Graph Theory, 2003
Circular chromatic number of subgraphs.
J. Graph Theory, 2003
Circular chromatic number of Kneser graphs.
J. Comb. Theory, Ser. B, 2003
An Analogue of Hajós' Theorem for the Circular Chromatic Number (II).
Graphs Comb., 2003
Circular chromatic numbers of a class of distance graphs.
Discret. Math., 2003
4-Colorable 6-regular toroidal graphs.
Discret. Math., 2003
Coloring the square of a <i>K</i><sub>4</sub>-minor free graph.
Discret. Math., 2003
Construction of <i>K<sub>n</sub></i>-minor free graphs with given circular chromatic number.
Discret. Math., 2003
Relaxed game chromatic number of graphs.
Discret. Math., 2003
Circulant Distant Two Labeling and Circular Chromatic Number.
Ars Comb., 2003
2002
Circular chromatic number of distance graphs with distance sets of cardinality 3.
J. Graph Theory, 2002
Edge-partitions of planar graphs and their game coloring numbers.
J. Graph Theory, 2002
Circular Colouring and Orientation of Graphs.
J. Comb. Theory, Ser. B, 2002
Asymptotic Clique Covering Ratios of Distance Graphs.
Eur. J. Comb., 2002
The level of nonmultiplicativity of graphs.
Discret. Math., 2002
On Hedetniemi's conjecture and the colour template scheme.
Discret. Math., 2002
The circular chromatic number of series-parallel graphs of large odd girth.
Discret. Math., 2002
Tight relation between the circular chromatic number and the girth of series-parallel graphs.
Discret. Math., 2002
2001
Game chromatic index of <i>k</i>-degenerate graphs.
J. Graph Theory, 2001
Circular chromatic number: a survey.
Discret. Math., 2001
Construction of sparse graphs with prescribed circular colorings.
Discret. Math., 2001
Circular Chromatic Number of Planar Graphs of Large Odd Girth.
Electron. J. Comb., 2001
Perfect Graphs for Generalized Colouring-Circular Perfect Graphs.
Proceedings of the Graphs, 2001
2000
The circular chromatic number of series-parallel graphs.
J. Graph Theory, 2000
The circular chromatic number of series-parallel graphs with large girth.
J. Graph Theory, 2000
The game coloring number of pseudo partial <i>k</i>-trees.
Discret. Math., 2000
Pseudo-Hamiltonian-connected graphs.
Discret. Appl. Math., 2000
1999
Star Extremal Circulant Graphs.
SIAM J. Discret. Math., 1999
A simple proof of Moser's theorem.
J. Graph Theory, 1999
Construction of uniquely <i>H</i>-colorable graphs.
J. Graph Theory, 1999
Distance graphs with missing multiples in the distance sets.
J. Graph Theory, 1999
Game chromatic number of outerplanar graphs.
J. Graph Theory, 1999
The Game Coloring Number of Planar Graphs.
J. Comb. Theory, Ser. B, 1999
Planar Graphs with Circular Chromatic Numbers between 3 and 4.
J. Comb. Theory, Ser. B, 1999
Distance Graphs and T-Coloring.
J. Comb. Theory, Ser. B, 1999
A bound for the game chromatic number of graphs.
Discret. Math., 1999
Circular chromatic numbers of Mycielski's graphs.
Discret. Math., 1999
Graphs Whose Circular Chromatic Number Equals the Chromatic Number.
Comb., 1999
1998
Multiple Capacity Vehicle Routing on Paths.
SIAM J. Discret. Math., 1998
Oriented walk double covering and bidirectional double tracing.
J. Graph Theory, 1998
Pattern Periodic Coloring of Distance Graphs.
J. Comb. Theory, Ser. B, 1998
Minimal Oriented Graphs of Diameter 2.
Graphs Comb., 1998
Relaxed Coloring of a Graph.
Graphs Comb., 1998
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.
Eur. J. Comb., 1998
Chromatic Ramsey numbers.
Discret. Math., 1998
1997
Acyclic and oriented chromatic numbers of graphs.
J. Graph Theory, 1997
A Coloring Problem for Weighted Graphs.
Inf. Process. Lett., 1997
The chromatic numbers of distance graphs.
Discret. Math., 1997
Multiplicativity of Acyclic Local Tournaments.
Comb., 1997
A note on graph reconstruction.
Ars Comb., 1997
1996
Uniquely <i>H</i>-colorable graphs with large girth.
J. Graph Theory, 1996
On bounded treewidth duality of graphs.
J. Graph Theory, 1996
Circular colorings of weighted graphs.
J. Graph Theory, 1996
On the bounds for the ultimate independence ratio of a graph.
Discret. Math., 1996
Star-extremal graphs and the lexicographic product.
Discret. Math., 1996
Complexity of Tree Homomorphisms.
Discret. Appl. Math., 1996
Star Chromatic Numbers of Graphs.
Comb., 1996
1995
The Existence of Homomorphisms to Oriented Cycles.
SIAM J. Discret. Math., 1995
On homomorphisms to acyclic local tournaments.
J. Graph Theory, 1995
A Polynomial Algorithm for Homomorphisms to Oriented Cycles.
J. Algorithms, 1995
Ramsey Families which Exclude a Graph.
Comb., 1995
1994
Multiplicativity of Oriented Cycles.
J. Comb. Theory, Ser. B, 1994
Homomorphisms to oriented paths.
Discret. Math., 1994
1993
Homomorphisms to oriented cycles.
Comb., 1993
1992
Star chromatic numbers and products of graphs.
J. Graph Theory, 1992
A simple proof of the multiplicativity of directed cycles of prime power length.
Discret. Appl. Math., 1992
