Group edge choosability of planar graphs without adjacent short cycles
From MaRDI portal
Publication:381084
DOI10.1007/s10114-013-2531-3zbMath1274.05117arXiv1102.4980OpenAlexW1959802414MaRDI QIDQ381084
Publication date: 15 November 2013
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.4980
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on group choosability of graphs with girth at least 4
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group chromatic number of graphs without \(K_5\)-minors
- On group choosability of graphs. II
- An inequality for the group chromatic number of a graph
- Mathematical Foundations of Computer Science 2004
- A note on group colorings