Edge coloring of planar graphs without adjacent 7-cycles

DOI10.1016/J.TCS.2018.05.006MaRDI QIDQ1643159zbMATH OpenOpenAlexWikidataFDO

Authors Wenwen Zhang, Jian-Liang Wu

Publication date 18 June 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.05.006

zbMATH Keywords

class 1cycleedge coloringplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
• Edge colorings of planar graphs without 6-cycles with three chords
• Edge colorings of planar graphs without 5-cycles with two chords
• Edge colorings of planar graphs without adjacent special cycles.
• Edge coloring of planar graphs which any two short cycles are adjacent at most once

Cites work

• A note on graphs of class I
• Edge colorings of graphs embeddable in a surface of low genus
• Edge-coloring critical graphs with high degree
• Every planar graph with maximum degree 7 is of class 1
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 1439502 (Why is no real title available?)
• Planar graphs of maximum degree seven are Class I

Cited in

(11)

• Graph edge coloring: a survey
• Edge colorings of planar graphs without 6-cycles with three chords
• The edge colorings of \(K_5\)-minor free graphs
• A survey on the cyclic coloring and its relaxations
• Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
• Optimal \(r\)-dynamic coloring of sparse graphs
• Edge colorings of planar graphs without adjacent special cycles.
• Facial rainbow edge-coloring of simple 3-connected plane graphs
• Edge coloring of planar graphs which any two short cycles are adjacent at most once
• Edge colorings of planar graphs without 5-cycles with two chords
• scientific article; zbMATH DE number 6945774 (Why is no real title available?)

This page was built for publication: Edge coloring of planar graphs without adjacent 7-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1643159)