List edge and list total coloring of planar graphs without intersecting 8-cycles
From MaRDI portal
Publication:5034571
DOI10.1080/09720529.2019.1696915zbMATH Open1482.05131OpenAlexW3017983911MaRDI QIDQ5034571FDOQ5034571
Authors:
Publication date: 18 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2019.1696915
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List edge and list total colourings of multigraphs
- A note on the minimum number of choosability of planar graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- List edge and list total colorings of planar graphs without 4-cycles
- The list chromatic index of a bipartite multigraph
- List-colourings of graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Choosability, edge choosability and total choosability of outerplane graphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On the total choosability of planar graphs and of sparse graphs
- Edge-choosability of multicircuits
- List-edge-coloring of planar graphs without 6-cycles with three chords
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)
