Some sufficient conditions for 1-planar graphs to be class 1

DOI10.1016/J.TCS.2014.11.031MaRDI QIDQ484318zbMATH OpenOpenAlexFDO

Authors Wenwen Zhang, Jian-Liang Wu

Publication date 6 January 2015

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

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

zbMATH Keywords

1-planar graphscycleedge coloring

Mathematics Subject Classification ID

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

Recommendations

• On edge colorings of 1-planar graphs without chordal 5-cycles.
• On edge colorings of 1-planar graphs without 5-cycles with two chords
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• Edge colorings of planar graphs without 5-cycles with two chords
• On edge colorings of \(1\)-planar graphs

Cites work

• A sufficient condition for a planar graph to be class I
• Ein Sechsfarbenproblem auf der Kugel
• Every planar graph with maximum degree 7 is of class 1
• Graph theory with applications
• scientific article; zbMATH DE number 3943825 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• On edge colorings of 1-planar graphs without adjacent triangles
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• On edge colorings of \(1\)-planar graphs
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• The size of edge chromatic critical graphs with maximum degree 6

Cited in

(8)

• Graph edge coloring: a survey
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• On edge colorings of 1-planar graphs with 6-cycles having at most three chords
• A sufficient condition for a planar graph to be of class 1
• scientific article; zbMATH DE number 3946161 (Why is no real title available?)
• Some criteria for a graph to be class 1
• scientific article; zbMATH DE number 1439502 (Why is no real title available?)
• A sufficient condition for an IC-planar graph to be of class 1

This page was built for publication: Some sufficient conditions for 1-planar graphs to be class 1

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