Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/edge-coloring-of-graphs-embedded-in-a-surface-of-nonnegative-I1oOWKBxad
References (14)
-
Rong Luo, Cun-Quan Zhang (2004)
Edge coloring of graphs with small average degreesDiscret. Math., 275
-
(1965)
Critical graphs with given chromatic class -
Xuechao Li, Rong Luo, Jianbing Niu (2006)
A note on class one graphs with maximum degree sixDiscret. Math., 306
-
G. Chang, Jianfeng Hou, Nicolas Roussel (2011)
Local condition for planar graphs of maximum degree 7 to be 8-totally colorableDiscret. Appl. Math., 159
-
Nicolas Roussel, Xuding Zhu (2010)
Total coloring of planar graphs of maximum degree eightInf. Process. Lett., 110
-
Limin Zhang (2000)
Every Planar Graph with Maximum Degree 7 Is of Class 1Graphs and Combinatorics, 16
-
(1964)
On an estimate of the chromatic index of a p-graph -
Daniel Sanders, Yue Zhao (2001)
Planar Graphs of Maximum Degree Seven are Class IJ. Comb. Theory, Ser. B, 83
-
Weifan Wang, Yongzhu Chen (2007)
A sufficient condition for a planar graph to be class 1Theor. Comput. Sci., 385
-
Guofei Zhou (2003)
A note on graphs of class IDiscret. Math., 263
-
Y. Bu, Weifan Wang (2006)
Some sufficient conditions for a planar graph of maximum degree six to be Class 1Discret. Math., 306
-
Wang Yi (2010)
A new sufficient condition for a planar graph of maximum degree six to be Class 1 -
Daniel Sanders, Yue Zhao (2003)
Coloring edges of graphs embedded in a surface of characteristic zeroJ. Comb. Theory, Ser. B, 87
-
Danjun Huang, Weifan Wang (2012)
Planar Graphs of Maximum Degree Six without 7-cycles are Class OneElectron. J. Comb., 19
- Publisher
- Springer Journals
- Copyright
- Copyright © 2017 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag GmbH Germany
- Subject
- Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
- ISSN
- 0168-9673
- eISSN
- 1618-3932
- DOI
- 10.1007/s10255-017-0693-y
- Publisher site
- See Article on Publisher Site
Abstract
Let G be a graph embeddable in a surface of nonnegative characteristic with maximum degree six. In this paper, we prove that if G contains no a vertex v which is contained in all cycles of lengths from 3 to 6, then G is of Class 1.
Journal
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Aug 7, 2017