Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review, editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!
NI Wei-ping. Edge colorings of planar graphs with maximum degree five[J]. Journal of East China Normal University (Natural Sciences), 2011, (2): 32-38.
Citation:
NI Wei-ping. Edge colorings of planar graphs with maximum degree five[J]. Journal of East China Normal University (Natural Sciences), 2011, (2): 32-38.
NI Wei-ping. Edge colorings of planar graphs with maximum degree five[J]. Journal of East China Normal University (Natural Sciences), 2011, (2): 32-38.
Citation:
NI Wei-ping. Edge colorings of planar graphs with maximum degree five[J]. Journal of East China Normal University (Natural Sciences), 2011, (2): 32-38.
By applying a discharging method and using some theorems of critical graphs, we proved that every planar graph G with Δ=5 is of class 1, if any 3-cycle is not adjacent to any 4-cycle or to any 5-cycle in G. Therefore, we concluded two sufficient conditions for planar graph G to be Class 1.
DownLoad: