An adjacency Lemma for critical multigraphs (Q942112): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2007.08.067
+Normal rank
@@ Property / OpenAlex ID @@
+W1993734719
@@ Property / OpenAlex ID: W1993734719 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124792267
@@ Property / Wikidata QID: Q124792267 / rank @@
+Normal rank
@@ Property / cites work @@
+On edge-colorings of graphs.
@@ Property / cites work: On edge-colorings of graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+On fans in multigraphs
@@ Property / cites work: On fans in multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some consequences of a theorem on fans
@@ Property / cites work: Some consequences of a theorem on fans / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-coloring of multigraphs: Recoloring technique
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank