On edge colorings of 1-toroidal graphs
From MaRDI portal
Publication:353624
DOI10.1007/s10114-013-1724-0zbMath1268.05053OpenAlexW2017880517MaRDI QIDQ353624
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
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On edge colorings of 1-planar graphs without adjacent triangles
- 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
- The structure of 1-planar graphs
- Light subgraphs in the family of 1-planar graphs with high minimum degree
- Planar graphs of maximum degree seven are Class I
- On edge colorings of \(1\)-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- (1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY
- Edge Coloring of Triangle-Free 1-Planar Graphs
- 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
- The size of edge chromatic critical graphs with maximum degree 6
- A new proof of the 6 color theorem
- Every planar graph with maximum degree 7 is of class 1
- Acyclic colouring of 1-planar graphs
This page was built for publication: On edge colorings of 1-toroidal graphs