Coloring of double disk graphs
From MaRDI portal
Cited in
(8)- A note on the minimum number of choosability of planar graphs
- Minimum number of disjoint linear forests covering a planar graph
- Optimal channel assignment with list-edge coloring
- Minimum choosability of planar graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- Note on coloring of double disk graphs
- An efficient case for computing minimum linear arboricity with small maximum degree
- Colorings and doubled colorings of virtual doodles
This page was built for publication: Coloring of double disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424964)