A new upper bound for the independence number of edge chromatic critical graphs (Q3096957): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.20552
@@ Property / DOI: 10.1002/jgt.20552 / rank @@
-Normal rank
@@ Property / cites work @@
+Bounds for the Independence Number of Critical Graphs
+Normal rank
@@ Property / cites work @@
+Independent sets and 2‐factors in edge‐chromatic‐critical graphs
+Normal rank
@@ Property / cites work @@
+A note on Vizing's independence number conjecture of edge chromatic critical graphs
+Normal rank
@@ Property / cites work @@
+The size of edge chromatic critical graphs with maximum degree 6
+Normal rank
@@ Property / cites work @@
+An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
+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 @@
+SOME UNSOLVED PROBLEMS IN GRAPH THEORY
@@ Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.20552
@@ Property / DOI: 10.1002/JGT.20552 / rank @@
+Normal rank