Edge Lower Bounds for List Critical Graphs, Via Discharging
暂无分享,去创建一个
[1] Alexandr V. Kostochka,et al. Ore-type versions of Brooks' theorem , 2009, J. Comb. Theory B.
[2] Uwe Schauz,et al. Mr. Paint and Mrs. Correct , 2009, Electron. J. Comb..
[3] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .
[4] Alexandr V. Kostochka,et al. Graphs with chromatic number close to maximum degree , 2012, Discret. Math..
[5] Landon Rabern,et al. Improved lower bounds on the number of edges in list critical and online list critical graphs , 2014, J. Comb. Theory, Ser. B.
[6] Landon Rabern,et al. Δ-Critical graphs with small high vertex cliques , 2012 .
[7] Uwe Schauz,et al. Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants , 2010, Electron. J. Comb..
[8] Jan Hladký,et al. Brooks' Theorem via the Alon-Tarsi Theorem , 2010, Discret. Math..
[9] Uwe Schauz,et al. Critically paintable, choosable or colorable graphs , 2012, Discret. Math..
[10] Michael Krivelevich,et al. An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs , 1997, Electron. J. Comb..
[11] Alexandr V. Kostochka,et al. Ore’s conjecture for k=4 and Grötzsch’s Theorem , 2014, Combinatorica.
[12] Michael Stiebitz. Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs , 1982, Comb..
[13] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[14] Xuding Zhu,et al. On-Line List Colouring of Graphs , 2009, Electron. J. Comb..
[15] Daniel W. Cranston,et al. An introduction to the discharging method via graph coloring , 2013, Discret. Math..
[16] Alexandr V. Kostochka,et al. A new lower bound on the number of edges in colour-critical graphs and hypergraphs , 2003, J. Comb. Theory, Ser. B.
[17] Daniel J. Katz,et al. Proof of a Conjecture of , 2011 .
[18] Alexandr V. Kostochka,et al. Ore's conjecture on color-critical graphs is almost true , 2012, J. Comb. Theory, Ser. B.