Interval Colourings of Some Regular Graphs
Abstract
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.