Uniquely D-colourable Digraphs with Large Girth
暂无分享,去创建一个
Bojan Mohar | Ararat Harutyunyan | P. Mark Kayll | Liam Rafferty | B. Mohar | P. Kayll | Liam Rafferty | Ararat Harutyunyan | P. M. Kayll
[1] Alexandr V. Kostochka,et al. Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number , 1999, Combinatorics, Probability and Computing.
[2] Igor Kríz,et al. Ahypergraph-free construction of highly chromatic graphs without short cycles , 1989, Comb..
[3] Xuding Zhu,et al. Circular chromatic number: a survey , 2001, Discret. Math..
[4] Stefan Hougardy,et al. Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth , 1998, Combinatorics, Probability and Computing.
[5] Robin Wilson,et al. Modern Graph Theory , 2013 .
[6] Jan Mycielski. Sur le coloriage des graphs , 1955 .
[7] Bojan Mohar,et al. The circular chromatic number of a digraph , 2004, J. Graph Theory.
[8] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.
[9] A. Leaf. GRAPH THEORY AND PROBABILITY , 1957 .
[10] Vojtech Rödl,et al. A short proof of the existence of highly chromatic hypergraphs without short cycles , 1979, J. Comb. Theory, Ser. B.
[11] Béla Bollobás,et al. Uniquely Colourable Graphs with Large Girth , 1976, Canadian Journal of Mathematics.
[12] Vladimír Müller,et al. On colorings of graphs without short cycles , 1979, Discret. Math..
[13] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[15] Dinoj Surendran,et al. The three colour problem , 1999 .
[16] Xuding Zhu,et al. Construction of uniquely H-colorable graphs , 1999 .
[17] Martin Aigner,et al. Proofs from THE BOOK , 1998 .
[18] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.
[19] Jaroslav Nesetril,et al. On sparse graphs with given colorings and homomorphisms , 2004, J. Comb. Theory, Ser. B.
[20] Xuding Zhu,et al. Graphs of Large Girth with Prescribed Partial Circular Colourings , 2005, Graphs Comb..
[21] John B. Kelly,et al. PATHS AND CIRCUITS IN CRITICAL GRAPHS. , 1954 .
[22] Bojan Mohar. Circular colorings of edge-weighted graphs , 2003, J. Graph Theory.
[23] Ararat Harutyunyan. Brooks-type results for coloring of digraphs , 2011 .
[24] Liam Rafferty. D-colorable digraphs with large girth , 2011 .
[25] Xuding Zhu,et al. Uniquely circular colourable and uniquely fractional colourable graphs of large girth , 2006, Contributions Discret. Math..
[26] Xuding Zhu,et al. Uniquely H -colorable graphs with large girth , 1996 .
[27] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[28] Frank Harary,et al. Graph Theory , 2016 .
[29] Jaroslav Nesetril,et al. Construction of sparse graphs with prescribed circular colorings , 2001, Discret. Math..
[30] L. Lovász. On chromatic number of finite set-systems , 1968 .