On edge colorings of \(1\)-planar graphs
From MaRDI portal
Publication:1944052
DOI10.1016/j.ipl.2010.11.001zbMath1259.05050OpenAlexW2092084263MaRDI QIDQ1944052
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (44)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ An improved upper bound on the linear 2-arboricity of 1-planar graphs ⋮ Adjacent vertex distinguishing edge coloring of IC-planar graphs ⋮ On edge colorings of 1-toroidal graphs ⋮ On total colorings of some special 1-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Light edges in 1‐planar graphs ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ On edge colorings of 1-planar graphs without adjacent triangles ⋮ 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ The linear 2-arboricity of IC-planar graphs ⋮ The edge chromatic number of outer-1-planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ 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 ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ Some sufficient conditions for 1-planar graphs to be class 1 ⋮ Graph edge coloring: a survey ⋮ A note on the surviving rate of 1-planar graphs ⋮ Light paths and edges in families of outer-1-planar graphs ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ 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 ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Light edges in 1-planar graphs of minimum degree 3 ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ Acyclic edge coloring of triangle-free 1-planar graphs ⋮ A sufficient condition for an IC-planar graph to be class 1 ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ Algorithms for 1-Planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ A matrix approach to hypergraph stable set and coloring problems with its application to storing problem ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles ⋮ On total colorings of 1-planar graphs ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
Cites Work
This page was built for publication: On edge colorings of \(1\)-planar graphs
