Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. (Q273167): Difference between revisions

@@ 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 @@
+6571680
@@ Property / zbMATH DE Number: 6571680 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graph
@@ Property / zbMATH Keywords: planar graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-list-coloring
@@ Property / zbMATH Keywords: 5-list-coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+critical graph
@@ Property / zbMATH Keywords: critical graph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1613467653
@@ Property / OpenAlex ID: W1613467653 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05927
@@ Property / arXiv ID: 1505.05927 / rank @@
+Normal rank
@@ Property / cites work @@
+-list-coloring planar graphs with distant precolored vertices
+Normal rank
@@ Property / cites work @@
+Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs
+Normal rank
@@ Property / cites work @@
+Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
+Normal rank
@@ Property / cites work @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Color-critical graphs on a fixed surface
@@ Property / cites work: Color-critical graphs on a fixed surface / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:273167