On one-sided interval edge colorings of biregular bipartite graphs
A proper edge t-coloring of a graph G is a coloring of edges of G with colors 1,2,…,t such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x is called a spectrum of x. Any nonempty subset of consecutive integers is...
Saved in:
| Date: | 2015 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2015
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/154262 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | On one-sided interval edge colorings of biregular bipartite graphs / R.R. Kamalian // Algebra and Discrete Mathematics. — 2015. — Vol. 19, № 2. — С. 193-199. — Бібліогр.: 29 назв. — англ. |