Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20630
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20630 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1487816497
@@ Property / OpenAlex ID: W1487816497 / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable coloring and the maximum degree
@@ Property / cites work: Equitable coloring and the maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+An Ore-type theorem on equitable coloring
@@ Property / cites work: An Ore-type theorem on equitable coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
+Normal rank
@@ Property / cites work @@
+A fast algorithm for equitable coloring
@@ Property / cites work: A fast algorithm for equitable coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On equitable \(\Delta\)-coloring of graphs with low average degree
+Normal rank
@@ Property / cites work @@
+On equitable coloring of bipartite graphs
@@ Property / cites work: On equitable coloring of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Graphs and an Application to Optimizing Municipal Services
+Normal rank
@@ Property / cites work @@
+Q4348809
@@ Property / cites work: Q4348809 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255998
@@ Property / cites work: Q4255998 / rank @@
+Normal rank