On edge colorings of 1-planar graphs without adjacent triangles

DOI10.1016/j.ipl.2011.10.021zbMath1239.05078OpenAlexW2059488568MaRDI QIDQ413262

Gui Zhen Liu, Xin Zhang

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.021

zbMATH Keywords

combinatorial problemsedge coloring1-planar graphs

Mathematics Subject Classification ID

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

Related Items (17)

Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ On edge colorings of 1-toroidal graphs ⋮ An annotated bibliography on 1-planarity ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ A note on total colorings of 1-planar graphs ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Some sufficient conditions for 1-planar graphs to be class 1 ⋮ Graph edge coloring: a survey ⋮ Light paths and edges in families of outer-1-planar graphs ⋮ Light subgraphs in the family of 1-planar graphs with high minimum degree ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ List edge and list total coloring of 1-planar graphs ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ Note on improper coloring of $1$-planar graphs ⋮ On total colorings of 1-planar graphs ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of 1-planar graphs
• Planar graphs of maximum degree seven are Class I
• On edge colorings of \(1\)-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• 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
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: On edge colorings of 1-planar graphs without adjacent triangles