A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
暂无分享,去创建一个
Ding-Zhu Du | Wei-Fan Wang | Yiqiao Wang | Yanwen Wang | Danjun Huang | D. Du | Weifan Wang | Yiqiao Wang | Danjun Huang | Yanwen Wang
[1] Rossella Petreschi,et al. L(h, 1)-labeling subclasses of planar graphs , 2004, J. Parallel Distributed Comput..
[2] Hamed Hatami,et al. Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number , 2005, J. Comb. Theory, Ser. B.
[3] Saieed Akbari,et al. r-Strong edge colorings of graphs , 2006, Discret. Math..
[4] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[5] Hao Li,et al. On the Vertex-Distinguishing Proper Edge-Colorings of Graphs , 1999, J. Comb. Theory B.
[6] Jianfang Wang,et al. Adjacent strong edge coloring of graphs , 2002, Appl. Math. Lett..
[7] Mirko Hornák,et al. On Neighbor-Distinguishing Index of Planar Graphs , 2014, J. Graph Theory.
[8] Wei-Fan Wang,et al. Some bounds on the neighbor-distinguishing index of graphs , 2015, Discret. Math..
[9] Xuding Zhu,et al. The surviving rate of an outerplanar graph for the firefighter problem , 2011, Theor. Comput. Sci..
[10] F. Harary,et al. Planar Permutation Graphs , 1967 .
[11] R. Schelp,et al. Vertex-distinguishing proper edge-colorings , 1997 .
[12] Roman Soták,et al. Arbitrarily large difference between dd-strong chromatic index and its trivial lower bound , 2013, Discret. Math..
[13] Arnfried Kemnitz,et al. d-strong Edge Colorings of Graphs , 2014, Graphs Comb..
[14] Richard H. Schelp,et al. Adjacent Vertex Distinguishing Edge-Colorings , 2007, SIAM J. Discret. Math..
[15] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .