Equitable coloring of three classes of 1-planar graphs
From MaRDI portal
Publication:1753367
DOI10.1007/s10255-018-0752-zzbMath1387.05099OpenAlexW2802636101MaRDI QIDQ1753367
Lan Xu, Xin Zhang, Hui-Juan Wang
Publication date: 29 May 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0752-z
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equitable \(\Delta\)-coloring of graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- A refinement of a result of Corrádi and Hajnal
- On equitable and equitable list colorings of series-parallel graphs
- On equitable colorings of sparse graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- On equitable \(\Delta\)-coloring of graphs with low average degree
- The structure of 1-planar graphs
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Ein Sechsfarbenproblem auf der Kugel
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
- Coloring plane graphs with independent crossings
- Equitable Colourings of d-degenerate Graphs
- A new proof of the 6 color theorem
- Drawing graph joins in the plane with restrictions on crossings
This page was built for publication: Equitable coloring of three classes of 1-planar graphs