Group edge choosability of planar graphs without adjacent short cycles (Q381084): Difference between revisions

@@ Property / author @@
-Xin Zhang
@@ Property / author: Xin Zhang / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1959802414
@@ Property / OpenAlex ID: W1959802414 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4980
@@ Property / arXiv ID: 1102.4980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+On group choosability of graphs. II
@@ Property / cites work: On group choosability of graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
+Normal rank
@@ Property / cites work @@
+Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
+Normal rank
@@ Property / cites work @@
+Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on group colorings
@@ Property / cites work: A note on group colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461502
@@ Property / cites work: Q5461502 / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the group chromatic number of a graph
+Normal rank
@@ Property / cites work @@
+Group chromatic number of graphs without \(K_5\)-minors
+Normal rank
@@ Property / cites work @@
+A note on group choosability of graphs with girth at least 4
+Normal rank