List edge colorings of planar graphs without adjacent 7-cycles
From MaRDI portal
Publication:2035728
DOI10.1155/2021/6695833zbMath1477.05081OpenAlexW3154831737MaRDI QIDQ2035728
Publication date: 25 June 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/6695833
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- A note on the minimum number of choosability of planar graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- On the total choosability of planar graphs and of sparse graphs
- 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
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List-colourings of graphs
- Edge-choosability of multicircuits
- List edge and list total colourings of multigraphs
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Choosability, edge choosability and total choosability of outerplane graphs
- The list chromatic index of a bipartite multigraph
- Some upper bounds on the total and list chromatic numbers of multigraphs
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
This page was built for publication: List edge colorings of planar graphs without adjacent 7-cycles
