Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777358 | European Journal of Combinatorics | 2017 | 21 Pages |
Abstract
As corollaries, we answer a question posed by Blackburn concerning the maximum length of t-subset packing sequences of constant radius and derive an asymptotically tight bound on the minimum number of colors in a vertex-distinguishing edge coloring of cubic planar graphs, which is a step towards confirming a conjecture of Burris and Schelp.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
MichaÅ DÄbski, Zbigniew Lonc, PaweÅ RzÄ
żewski,