Geodesic
Planar graphs of maximum degree six without 7-cycles are class one
Danjun Huang1 ; Weifan Wang1
1Zhejiang Normal University
The electronic journal of combinatorics, Tome 19 (2012) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.
DOI : 10.37236/2589
Classification : 05C15, 05C10
Mots-clés : planar graph, edge coloring, class one, cycle

Danjun Huang  1   ; Weifan Wang  1

1 Zhejiang Normal University 
@article{10_37236_2589,
     author = {Danjun Huang and Weifan Wang},
     title = {Planar graphs of maximum degree six without 7-cycles are class one},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {3},
     doi = {10.37236/2589},
     zbl = {1252.05063},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2589/}
}
TY  - JOUR
AU  - Danjun Huang
AU  - Weifan Wang
TI  - Planar graphs of maximum degree six without 7-cycles are class one
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2589/
DO  - 10.37236/2589
ID  - 10_37236_2589
ER  - 
%0 Journal Article
%A Danjun Huang
%A Weifan Wang
%T Planar graphs of maximum degree six without 7-cycles are class one
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/2589/
%R 10.37236/2589
%F 10_37236_2589
Danjun Huang; Weifan Wang. Planar graphs of maximum degree six without 7-cycles are class one. The electronic journal of combinatorics, Tome 19 (2012) no. 3. doi: 10.37236/2589

Cité par Sources :