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.
References
F.Harary,"Graph Theory" , Addison-Wesley, Reading, MA,1969.
V.G.Vizing,The chromatic index of a multigraph, Kibernetika 3 (1965) ,pp.29-39.
A .A.Zykov,Theory of fiite graphs, Novosibirsk, Nauka,1969.
A .S. A sratian,R.R. Kamalian, Interval colourings of edges of a multigraph, Appl. Math.5 (1987) ,Yerevan State University, pp.25-34.
R.R. Kamalian,Interval Edge colourings of Graphs",Doctoral dissertation, The Institute of Mathematics of the Siberian Branch of the Academy of Sciences of USSR, Novosibirsk,1990.
S.V . Sevastianov, On interval colorability of edges of a bipartite graph, Methods of Discr.Anal.In solution of extremal problems. The Institute of Mathematics of the Siberian Branch of the Academy of Sciences of USSR, Novosibirsk,N50 (1990),pp.61-72.
I.Holyer,The NP-completeness of edge colouring, SIAM J.Comput.10,N4(1981),pp.718-720.
S. Cook, The complexity of theorem-proving procedures. In P roc.3rd ACM Symp. on Theory of Computing,1971,pp.151-158.
R.M.Karp,Reducibility among Combinatorial Problems, in Complexity of Computer Computations" (R.E. Miller and J.W.Thatcher, Eds.),New York,1972,pp.85-103.
E.T.Parker,Edge-colouring numbers of some regular graphs,Proc.Amer. Math.Soc.37,(1973),pp.423-424.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
