Equitable coloring of three classes of 1-planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- scientific article; zbMATH DE number 1308943 (Why is no real title available?)
- scientific article; zbMATH DE number 1046311 (Why is no real title available?)
- scientific article; zbMATH DE number 6424528 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- A new proof of the 6 color theorem
- A refinement of a result of Corrádi and Hajnal
- Coloring plane graphs with independent crossings
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Drawing graph joins in the plane with restrictions on crossings
- Ein Sechsfarbenproblem auf der Kugel
- Equitable Colourings of d-degenerate Graphs
- Equitable \(\Delta\)-coloring of graphs
- Equitable coloring and the maximum degree
- Equitable colorings of planar graphs with maximum degree at least nine
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- On equitable -coloring of graphs with low average degree
- On equitable and equitable list colorings of series-parallel graphs
- On equitable coloring of bipartite graphs
- On equitable colorings of sparse graphs
- The structure of 1-planar graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
Cited in
(4)
This page was built for publication: Equitable coloring of three classes of 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753367)