List edge and list total coloring of planar graphs without intersecting 8-cycles
From MaRDI portal
Publication:5034571
Cites work
- A note on the minimum number of choosability of planar graphs
- Choosability, edge choosability and total choosability of outerplane graphs
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Edge-choosability of multicircuits
- List edge and list total coloring of planar graphs with maximum degree 8
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colourings of multigraphs
- List-colourings of graphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- List-edge-coloring of planar graphs without 6-cycles with three chords
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- On the total choosability of planar graphs and of sparse graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- The list chromatic index of a bipartite multigraph
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Cited in
(2)
This page was built for publication: List edge and list total coloring of planar graphs without intersecting 8-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034571)
