A note on edge-group choosability of planar graphs without 5-cycles (Q2221861): Difference between revisions
From MaRDI portal
Latest revision as of 11:26, 24 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on edge-group choosability of planar graphs without 5-cycles |
scientific article |
Statements
A note on edge-group choosability of planar graphs without 5-cycles (English)
0 references
3 February 2021
0 references
Summary: This paper is devoted to a study of the concept of edge-group choosability of graphs. We say that \(G\) is edge-\(k\)-group choosable if its line graph is \(k\)-group choosable. In this paper, we study an edge-group choosability version of Vizing conjecture for planar graphs without 5-cycles and for planar graphs without noninduced 5-cycles.
0 references
edge-\(k\)-colorability
0 references
edge-\(k\)-choosability
0 references
chromatic index
0 references
0 references
