A note on edge-group choosability of planar graphs without 5-cycles

DOI10.1155/2020/4639260zbMath1462.05114OpenAlexW3094083170MaRDI QIDQ2221861

Amir Khamseh

Publication date: 3 February 2021

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

Full work available at URL: https://doi.org/10.1155/2020/4639260

zbMATH Keywords

chromatic indexedge-\(k\)-choosabilityedge-\(k\)-colorability

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• A note on group choosability of graphs with girth at least 4
• Edge-choosability of planar graphs without non-induced 5-cycles
• List-colourings of graphs
• List edge chromatic number of graphs with large girth
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Choosability and edge choosability of planar graphs without five cycles
• Edge-group choosability of outerplanar and near-outerplanar graphs
• Mathematical Foundations of Computer Science 2004

This page was built for publication: A note on edge-group choosability of planar graphs without 5-cycles