Edge-colouring of joins of regular graphs. I (Q849137): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-009-9235-8
@@ Property / DOI: 10.1007/s10878-009-9235-8 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-009-9235-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3021046945
@@ Property / OpenAlex ID: W3021046945 / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic index of graphs of even order with many edges
+Normal rank
@@ Property / cites work @@
+Edge-colouring of join graphs
@@ Property / cites work: Edge-colouring of join graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-colouring of regular graphs of large degree
@@ Property / cites work: Edge-colouring of regular graphs of large degree / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-colouring of joins of regular graphs. I
@@ Property / cites work: Edge-colouring of joins of regular graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+Investigations on an edge coloring problem
@@ Property / cites work: Investigations on an edge coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic index of complete multipartite graphs
+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 @@
+The Solution of a Timetabling Problem
@@ Property / cites work: The Solution of a Timetabling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
+Normal rank
@@ Property / cites work @@
+Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
+Normal rank
@@ Property / cites work @@
+How to find overfull subgraphs in graphs with large maximum degree. II
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut-Sets and <i>b</i>-Matchings
@@ Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Edge coloring regular graphs of high degree
@@ Property / cites work: Edge coloring regular graphs of high degree / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic index of graphs with a spanning star
+Normal rank
@@ Property / DOI @@
+.1007/S10878-009-9235-8
@@ Property / DOI: 10.1007/S10878-009-9235-8 / rank @@
+Normal rank