论文信息 - Group edge choosability of planar graphs without adjacent short cycles - 字舞流文

Group edge choosability of planar graphs without adjacent short cycles

In this paper, we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group (Δ(G)+1)-edge-choosable, and some planar graphs with large girth and maximum degree are group Δ(G)-edge-choosable.

Guizhen Liu | Xin Zhang

[1] Hong-Jian Lai,et al. Group Chromatic Number of Graphs without K5-Minors , 2002, Graphs Comb..

[2] Gholam Reza Omidi. A Note on Group Choosability of Graphs with Girth at least 4 , 2011, Graphs Comb..

[3] Nathann Cohen,et al. Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof , 2010, Discret. Math..

[4] Nathan Linial,et al. Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties , 1992, J. Comb. Theory, Ser. B.

[5] Jianfeng Hou,et al. Edge-choosability of planar graphs without adjacent triangles or without 7-cycles , 2009, Discret. Math..

[6] Daniel Král,et al. Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract) , 2004, MFCS.

[7] Daniel Král,et al. A note on group colorings , 2005, J. Graph Theory.

[8] Hong-Jian Lai,et al. An inequality for the group chromatic number of a graph , 2007, Discret. Math..

[9] Hong-Jian Lai,et al. Group Colorability of Graphs , 2002, Ars Comb..

[10] Group coloring and list group coloring are ΠP2-Complete , 2004 .

[12] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[13] J. A. Bondy,et al. Graph Theory with Applications , 1978 .