Equitable edge-colorings of simple graphs (Q3083408): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20499
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20499 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2068003283
@@ Property / OpenAlex ID: W2068003283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5184931
@@ Property / cites work: Q5184931 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Graphs of High Degree are 1-Factorizable
@@ Property / cites work: Regular Graphs of High Degree are 1-Factorizable / 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 @@
+Improved bounds for the chromatic index of graphs and multigraphs
+Normal rank
@@ Property / cites work @@
+\((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
@@ Property / cites work: \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for equitable edge-colourings of simple graphs
+Normal rank
@@ Property / cites work @@
+Class one graphs
@@ Property / cites work: Class one graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some graphs of class 1 for \(f\)-colorings
@@ Property / cites work: Some graphs of class 1 for \(f\)-colorings / rank @@
+Normal rank