On the size of edge-coloring critical graphs with maximum degree 4 (Q998479): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2007.10.013
@@ Property / DOI: 10.1016/j.disc.2007.10.013 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.10.013
+Normal rank
@@ Property / OpenAlex ID @@
+W1974904207
@@ Property / OpenAlex ID: W1974904207 / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of edge-chromatic critical graphs
@@ Property / cites work: On the size of edge-chromatic critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-coloring critical graphs with high degree
@@ Property / cites work: Edge-coloring critical graphs with high degree / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
+Normal rank
@@ Property / cites work @@
+On the size of edge chromatic critical graphs
@@ Property / cites work: On the size of edge chromatic critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+SOME UNSOLVED PROBLEMS IN GRAPH THEORY
@@ Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds for the size of edge chromatic critical graphs
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2007.10.013
@@ Property / DOI: 10.1016/J.DISC.2007.10.013 / rank @@
+Normal rank