Author of the publication

Decomposition of sparse graphs, with application to game coloring number.

, , , , and . Discret. Math., 310 (10-11): 1520-1523 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Every graph is (2, 3)-choosable., and . Combinatorica, 36 (1): 121-127 (2016)Circulant Distant Two Labeling and Circular Chromatic Number., and . Ars Comb., (2003)Game chromatic index of k-degenerate graphs., and . J. Graph Theory, 36 (3): 144-155 (2001)The circular chromatic number of series-parallel graphs., and . J. Graph Theory, 33 (1): 14-24 (2000)On the circular chromatic number of circular partitionable graphs., and . J. Graph Theory, 52 (4): 294-306 (2006)Multilevel Distance Labelings for Paths and Cycles., and . SIAM J. Discret. Math., 19 (3): 610-621 (2005)Circular Degree Choosability., and . Electr. J. Comb., (2008)Permanent Index of Matrices Associated with Graphs., and . Electron. J. Comb., 24 (1): 1 (2017)Locally planar graphs are 2-defective 4-paintable., and . Eur. J. Comb., (2016)Bipartite density of triangle-free subcubic graphs.. Discret. Appl. Math., 157 (4): 710-714 (2009)