Interval colorings of complete bipartite graphs and trees

Abstract

A translation from Russian of the work of R.R. Kamalian "Interval colorings of complete bipartite graphs and trees", Preprint of the Computing Centre of the Academy of Sciences of Armenia, Yerevan, 1989. (Was published by the decision of the Academic Council of the Computing Centre of the Academy of Sciences of Armenian SSR and Yerevan State University from 7.09.1989).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…