On edge colorings of 1-toroidal graphs

DOI10.1007/S10114-013-1724-0zbMATH Open1268.05053OpenAlexW2017880517MaRDI QIDQ353624FDOQ353624

Authors: Guizhen Liu, Xin Zhang 

Publication date: 16 July 2013

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-013-1724-0

Recommendations

• On edge colorings of \(1\)-planar graphs
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
• Edge colourings of embedded 1-graphs
• Coloring edges of embedded graphs

zbMATH Keywords

edge coloring1-planar graph1-toroidal graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• A new proof of the 6 color theorem
• Ein Sechsfarbenproblem auf der Kugel
• Title not available (Why is that?)
• The structure of 1-planar graphs
• Title not available (Why is that?)
• Planar graphs of maximum degree seven are Class I
• The size of edge chromatic critical graphs with maximum degree 6
• Every planar graph with maximum degree 7 is of class 1
• On edge colorings of 1-planar graphs without adjacent triangles
• Light subgraphs in the family of 1-planar graphs with high minimum degree
• On edge colorings of \(1\)-planar graphs
• On the linear arboricity of 1-planar graphs
• (\(1,\lambda\))-embedded graphs and the acyclic edge choosability
• Edge Coloring of Triangle-Free 1-Planar Graphs
• Title not available (Why is that?)
• On local properties of 1-planar graphs with high minimum degree
• On local structure of 1-planar graphs of minimum degree 5 and girth 4
• Light edges in 1-planar graphs with prescribed minimum degree
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• New upper bounds for the heights of some light subgraphs in 1-planar graphs with high minimum degree
• Acyclic colouring of 1-planar graphs
• On \((p,1)\)-total labelling of 1-planar graphs
• List edge and list total coloring of 1-planar graphs
• A linear-time algorithm for 7-coloring 1-plane graphs

Cited In (3)

• Edge colourings of embedded 1-graphs
• On restricted matching extension of 1-embeddable graphs in surfaces with small genus
• Acyclic edge coloring of triangle-free toroidal graphs

This page was built for publication: On edge colorings of 1-toroidal graphs

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