The classification of \(f\)-coloring of graphs with large maximum degree (Q1740035): Difference between revisions

@@ Property / cites work @@
+The <i>f</i>-Chromatic Index of a Graph Whose <i>f</i>-Core Has Maximum Degree 2
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of edge-coloring in graphs
@@ Property / cites work: A generalization of edge-coloring in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Some results about <i>f</i>‐critical graphs
@@ Property / cites work: Some results about <i>f</i>‐critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colouring and the probabilistic method
@@ Property / cites work: Graph colouring and the probabilistic method / rank @@
+Normal rank
@@ Property / cites work @@
+Some sufficient conditions for a graph to be of \(C_f\) 1
+Normal rank
@@ Property / cites work @@
+\(f\)-class two graphs whose \(f\)-cores have maximum degree two
+Normal rank
@@ Property / cites work @@
+The classification of complete graphs \(K_n\) on \(f\)-coloring
+Normal rank