Interval Colourings of Some Regular Graphs
Rafael R. Kamalian, Petros A. Petrosyan
TL;DR
This paper establishes a lower bound on the maximum number of colors used in interval colorings of certain regular graphs, advancing understanding of graph coloring constraints.
Contribution
It provides a new lower bound for the maximum colors in interval colorings of specific regular graphs, a novel theoretical insight.
Findings
Lower bound for maximum colors established
Applicable to some regular graphs
Advances theoretical understanding of interval colorings
Abstract
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
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