List edge colorings of planar graphs without adjacent 7-cycles

DOI10.1155/2021/6695833MaRDI QIDQ2035728zbMATH OpenOpenAlexFDO

Authors Wenwen Zhang

Publication date 25 June 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/6695833

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Review text

Summary: In this paper, we get that \(G\) is edge-\(k\)-choosable \((k=\max\{10, \Delta (G)\})\) for planar graph \(G\) without adjacent 7-cycles.

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

(1)

• Three-coloring and list three-coloring of graphs without induced paths on seven vertices

This page was built for publication: List edge colorings of planar graphs without adjacent 7-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035728)