Equitable coloring of graphs beyond planarity
From MaRDI portal
Cites work
- A fast algorithm for equitable coloring
- A refinement of a result of Corrádi and Hajnal
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An annotated bibliography on 1-planarity
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
- Coloring plane graphs with independent crossings
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Equitable Coloring
- Equitable coloring and the maximum degree
- Equitable coloring in 1-planar graphs
- Equitable coloring of planar graphs with maximum degree at least eight
- Equitable coloring of three classes of 1-planar graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- scientific article; zbMATH DE number 1308943 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- IC-planar graphs are 6-choosable
- On equitable colorings of sparse graphs
- Perfect Graphs and an Application to Optimizing Municipal Services
- Recognizing IC-planar and NIC-planar graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Weak-dynamic coloring of graphs beyond-planarity
This page was built for publication: Equitable coloring of graphs beyond planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885545)