z-logo
HomeZAIABlog
open-access-imgOpen Access
Edge Colorings of Planar Graphs without 6-Cycles with Two Chords
Author(s) -
Ling Xue,
Jianliang Wu
Publication year - 2013
Publication title -
open journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2161-7643
pISSN - 2161-7635
DOI - 10.4236/ojdm.2013.32016
Subject(s) - combinatorics , mathematics , planar graph , enhanced data rates for gsm evolution , planar , discrete mathematics , graph , computer science , artificial intelligence , computer graphics (images)

It is proved here that if a planar graph has maximum degree at least 6 and any 6-cycle contains at most one chord, then it is of class 1.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Empowering knowledge with every search

About

AboutCareersPublisher PartnersContact Us

Learn

FAQsBlogTerms of UsePrivacy Policy

Discover

Explore

Copyright Knowledge E © 2025. All Rights Reserved.