Edge-group choosability of outerplanar and near-outerplanar graphs

DOI10.22108/toc.2020.116355.1633zbMath1474.05134OpenAlexW3084495880MaRDI QIDQ4997221

Amir Khamseh

Publication date: 28 June 2021

Full work available at URL: https://doaj.org/article/c026eabd30ac43c4b93d537f3ca60dac

zbMATH Keywords

list coloringgroup choosabilityedge-group choosability

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on group choosability of graphs with girth at least 4
• Edge and total choosability of near-outerplanar graphs
• 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
• Edge-choosability of multicircuits
• List edge and list total colourings of multigraphs
• Choosability, edge choosability and total choosability of outerplane graphs
• The list chromatic index of a bipartite multigraph
• On group choosability of graphs. II
• Topology of series-parallel networks
• A short proof of a theorem of dirac's about hadwiger's conjecture
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Mathematical Foundations of Computer Science 2004

This page was built for publication: Edge-group choosability of outerplanar and near-outerplanar graphs