Interval Colourings of Some Regular Graphs
classification
💻 cs.DM
keywords
colouringsgraphsintervalregularsomeboundcolorsgreatest
read the original abstract
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.