On the total choosability of planar graphs and of sparse graphs (Q407575): Difference between revisions

@@ Property / author @@
+Gerard Jennhwa Chang
@@ Property / author: Gerard Jennhwa Chang / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6018489
@@ Property / zbMATH DE Number: 6018489 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+total coloring
@@ Property / zbMATH Keywords: total coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+total choosability
@@ Property / zbMATH Keywords: total choosability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cycle-free
@@ Property / zbMATH Keywords: cycle-free / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximum average degree
@@ Property / zbMATH Keywords: maximum average degree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mad
@@ Property / zbMATH Keywords: mad / rank @@
+Normal rank

Revision as of 17:50, 29 June 2023