论文信息 - A sufficient condition for a planar graph to be class 1 - 字舞流文

A sufficient condition for a planar graph to be class 1

We prove that every planar graph G with @D=6 is of Class 1 if it does not contain a 5-cycle with a chord.

Wei-Fan Wang | Yongzhu Chen

[1] Wei-Fan Wang,et al. Some sufficient conditions for a planar graph of maximum degree six to be Class 1 , 2006, Discret. Math..

[2] Rong Luo,et al. A note on class one graphs with maximum degree six , 2006, Discret. Math..

[3] Yue Zhao,et al. Coloring edges of graphs embedded in a surface of characteristic zero , 2003, J. Comb. Theory, Ser. B.

[4] Rong Luo,et al. Edge coloring of graphs with small average degrees , 2004, Discret. Math..

[5] Limin Zhang,et al. Every Planar Graph with Maximum Degree 7 Is of Class 1 , 2000, Graphs Comb..

[6] Zhou Guofei,et al. A note on graphs of class I , 2003 .

[7] Yue Zhao,et al. Planar Graphs of Maximum Degree Seven are Class I , 2001, J. Comb. Theory B.