Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic
2017
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
37
References
1
Citations
NaN
KQI