On edge colorings of 1-planar graphs without adjacent triangles
From MaRDI portal
Publication:413262
DOI10.1016/J.IPL.2011.10.021zbMATH Open1239.05078OpenAlexW2059488568MaRDI QIDQ413262FDOQ413262
Authors: Xin Zhang, Guizhen Liu 
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
Recommendations
- On edge colorings of \(1\)-planar graphs
- On edge colorings of 1-planar graphs without 5-cycles with two chords
- Edge coloring of \(1\)-planar graphs without intersecting triangles and chordal \(5\)-cycles.
- On total colorings of 1-planar graphs
- On edge colorings of 1-planar graphs with 6-cycles having at most three chords
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Ein Sechsfarbenproblem auf der Kugel
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The structure of 1-planar graphs
- Planar graphs of maximum degree seven are Class I
- The size of edge chromatic critical graphs with maximum degree 6
- Title not available (Why is that?)
- Every planar graph with maximum degree 7 is of class 1
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- On edge colorings of \(1\)-planar graphs
- Title not available (Why is that?)
Cited In (20)
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
- A structure of 1-planar graph and its applications to coloring problems
- Light paths and edges in families of outer-1-planar graphs
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree
- On total colorings of 1-planar graphs
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- Some sufficient conditions for 1-planar graphs to be class 1
- Total colorings of planar graphs without adjacent triangles
- The number of colorings of planar graphs with no separating triangles
- On edge colorings of 1-toroidal graphs
- An annotated bibliography on 1-planarity
- Note on improper coloring of $1$-planar graphs
- Triangle edge deletion on planar glasses-free RGB-digraphs
- On \((p,1)\)-total labelling of 1-planar graphs
- List edge and list total coloring of 1-planar graphs
- Graph edge coloring: a survey
- On edge colorings of 1-planar graphs without 5-cycles with two chords
- Light subgraphs in the family of 1-planar graphs with high minimum degree
- A note on total colorings of 1-planar graphs
This page was built for publication: On edge colorings of 1-planar graphs without adjacent triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413262)
