Packing chromatic number of subcubic graphs
暂无分享,去创建一个
[1] Éric Sopena,et al. On the packing coloring of undirected and oriented generalized theta graphs , 2016, Australas. J Comb..
[2] Mario Valencia-Pabon,et al. The packing chromatic number of hypercubes , 2015, Discret. Appl. Math..
[3] Béla Bollobás,et al. The independence ratio of regular graphs , 1981 .
[4] Olivier Togni,et al. Subdivision into i-packings and S-packing chromatic number of some lattices , 2015, Ars Math. Contemp..
[5] Edward A. Bender,et al. The asymptotic number of non-negative integer matrices with given row and column sums , 1974, Discret. Math..
[6] Sandi Klavzar,et al. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees , 2007, Electron. Notes Discret. Math..
[7] Danilo Korze,et al. On the packing chromatic number of square and hexagonal lattice , 2014, Ars Math. Contemp..
[8] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[9] Wayne Goddard,et al. Braodcast Chromatic Numbers of Graphs , 2008, Ars Comb..
[10] Nicolas Gastineau,et al. Dichotomies properties on computational complexity of S-packing coloring problems , 2013, Discret. Math..
[11] Éric Sopena,et al. Packing Coloring of Some Undirected and Oriented Coronae Graphs , 2017, Discuss. Math. Graph Theory.
[12] Christian Sloper. AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 29 (2004), Pages 309–321 An eccentric coloring of trees , 2022 .
[13] Carlos Hoppen,et al. Properties of regular graphs with large girth via local algorithms , 2016, J. Comb. Theory, Ser. B.
[14] Gabriela R. Argiroffo,et al. The packing coloring problem for lobsters and partner limited graphs , 2014, Discret. Appl. Math..
[15] Sandi Klavzar,et al. Packing Chromatic Number of Base-3 Sierpiński Graphs , 2016, Graphs Comb..
[16] Sandi Klavžar,et al. Packing chromatic number versus chromatic and clique number , 2017, 1707.04910.
[17] Olivier Togni,et al. S-packing colorings of cubic graphs , 2016, Discret. Math..
[18] Sandi Klavzar,et al. Packing chromatic number under local changes in a graph , 2017, Discret. Math..
[19] Douglas F. Rall,et al. Packing chromatic number, $(1,1,2,2)$-colorings, and characterizing the Petersen graph , 2016 .
[20] N. Wormald. Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.
[21] Stanislav Jendrol',et al. Facial packing edge-coloring of plane graphs , 2016, Discret. Appl. Math..
[22] Jirí Fiala,et al. The packing chromatic number of infinite product graphs , 2009, Eur. J. Comb..
[23] Nicholas C. Wormald,et al. Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs , 2013, Comb..
[24] Sandi Klavzar,et al. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees , 2007, Discret. Appl. Math..
[25] Jirí Fiala,et al. Complexity of the Packing Coloring Problem for Trees , 2008, WG.