scientific article; zbMATH DE number 6945774

MaRDI QIDQ4684518zbMATH OpenFDO

Authors Wenwen Zhang, Jian-Liang Wu

Publication date 1 October 2018

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)

Recommendations

• Total coloring of planar graphs without 7-cycles with chords
• Edge colorings of planar graphs without 6-cycles with three chords
• Edge coloring of planar graphs without adjacent 7-cycles
• Total coloring of planar graphs without chordal 7-cycles
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• Edge-choosability of planar graphs without chordal 7-cycles.
• Total coloring of planar graphs with 7-cycles containing at most two chords
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
• On 3-colorable plane graphs without 5- and 7-cycles

Cited in

(6)

• Edge colorings of planar graphs without 6-cycles with three chords
• Subcubic planar graphs of girth 7 are class I
• A survey on the cyclic coloring and its relaxations
• Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
• Facial rainbow edge-coloring of simple 3-connected plane graphs
• Edge colorings of planar graphs without 5-cycles with two chords

This page was built for publication:

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