Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs

A proper edge $t$-coloring of a graph $G$ is a coloring of edges of $G$ with colors $1,2,...,t$ such that each of $t$ colors is used, and adjacent edges are colored differently. The set of colors of edges incident with a vertex $x$ of $G$ is called a spectrum of $x$. A proper edge $t$-coloring of a graph $G$ is interval for its vertex $x$ if the spectrum of $x$ is an interval of integers. A proper edge $t$-coloring of a graph $G$ is persistent-interval for its vertex $x$ if the spectrum of $x$ is an interval of integers beginning from the color 1. For graphs $G$ from some classes of graphs, we obtain estimates for the possible number of vertices for which a proper edge $t$-coloring of $G$ can be interval or persistent-interval.

[1]  Yair Caro,et al.  Generalized 1-factorization of trees , 1981, Discret. Math..

[2]  Armen S. Asratian,et al.  Some results on interval edge colorings of (a, B)-biregular bipartitie graphs , 2006 .

[3]  Li Xiao.  On the Chromatic Index of a Multigraph , 2001 .

[4]  Armen S. Asratian,et al.  Interval colorings of edges of a multigraph , 2014, ArXiv.

[5]  Krzysztof Giaro,et al.  Compact Scheduling In Open Shop With Zero-One Time Operations , 1999 .

[6]  Artem V. Pyatkin.  Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs , 2004, J. Graph Theory.

[7]  C. J. Casselgren,et al.  Some results on interval edge colorings of ( α , β )-biregular bipartite graphs , 2007 .

[8]  Krzysztof Giaro.  The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard , 1997, Ars Comb..

[9]  Armen S. Asratian,et al.  Investigation on Interval Edge-Colorings of Graphs , 1994, J. Comb. Theory, Ser. B.

[10]  D. West.  Introduction to Graph Theory , 1995 .

[11]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[12]  Rafayel Kamalian.  On a number of vertices with an interval spectrum in proper edge colorings of some graphs , 2011 .

[13]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[14]  Douglas B. West,et al.  Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs , 2007, J. Graph Theory.

[15]  Denis Hanson,et al.  On interval colourings of bi-regular bipartite graphs , 1998, Ars Comb..

[16]  Armen S. Asratian,et al.  A sufficient condition for interval edge colorings of (4,3)-biregular bipartite graphs , 2006 .

[17]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.