Interval Edge Colourings of Complete Graphs and n-cubes
Petros A. Petrosyan
TL;DR
This paper investigates the range of possible numbers of colours used in interval edge colourings of complete graphs and n-cubes, establishing bounds for these colourings.
Contribution
It provides new bounds for the number of colours in interval edge colourings of complete graphs and n-cubes.
Findings
Bounds are established for the number of colours in interval edge colourings.
Results apply specifically to complete graphs and n-cubes.
The paper advances understanding of colourings in graph theory.
Abstract
For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Graph Labeling and Dimension Problems