Edge-colouring of joins of regular graphs. II
From MaRDI portal
Publication:1945699
Recommendations
- Edge-colouring of joins of regular graphs. I
- Edge-colouring of join graphs
- On edge cover coloring of join graphs.
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
- Edge-colouring of regular graphs of large degree
- scientific article; zbMATH DE number 3918397
- Some results on edge-colourings of graphs
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- Almost regular edge colorings and regular decompositions of complete graphs
- Vertex-distinguishing edge-colorings of 2-regular graphs
Cites work
- Edge coloring regular graphs of high degree
- Edge-colouring of join graphs
- Edge-colouring of joins of regular graphs. I
- Edge-colouring of regular graphs of large degree
- Investigations on an edge coloring problem
- The chromatic index of complete multipartite graphs
- The chromatic index of graphs of even order with many edges
- The NP-Completeness of Edge-Coloring
- The Solution of a Timetabling Problem
Cited in
(11)- Amalgamations of almost regular edge-colourings of simple graphs
- Graph edge coloring: a survey
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Edge-colouring graphs with bounded local degree sums
- Edge-colouring of join graphs
- Edge-colouring of regular graphs of large degree
- On the chromatic index of cographs and join graphs
- scientific article; zbMATH DE number 1156685 (Why is no real title available?)
- scientific article; zbMATH DE number 6273774 (Why is no real title available?)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
- Edge-colouring of joins of regular graphs. I
This page was built for publication: Edge-colouring of joins of regular graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945699)