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 s...
Gespeichert in:
| Veröffentlicht in: | Algebra and Discrete Mathematics |
|---|---|
| Datum: | 2015 |
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2015
|
| Online Zugang: | https://nasplib.isofts.kiev.ua/handle/123456789/154262 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | On one-sided interval edge colorings of biregular bipartite graphs / R.R. Kamalian // Algebra and Discrete Mathematics. — 2015. — Vol. 19, № 2. — С. 193-199. — Бібліогр.: 29 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862537626144210944 |
|---|---|
| author | Kamalian, R.R. |
| author_facet | Kamalian, R.R. |
| citation_txt | On one-sided interval edge colorings of biregular bipartite graphs / R.R. Kamalian // Algebra and Discrete Mathematics. — 2015. — Vol. 19, № 2. — С. 193-199. — Бібліогр.: 29 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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 called an interval. A
proper edge t-coloring of a graph G is interval in the vertex
x if the spectrum of x is an interval. A proper edge
t-coloring φ of a graph G is interval on a subset R0
of vertices of G, if for any x∈R0, φ is interval in
x. A subset R of vertices of G has an i-property if there is
a proper edge t-coloring of G which is interval on R. If G
is a graph, and a subset R of its vertices has an i-property,
then the minimum value of t for which there is a proper edge
t-coloring of G interval on R is denoted by wR(G). We estimate the value of this parameter for biregular bipartite graphs in the case when R is one of the sides of a bipartition of the graph
|
| first_indexed | 2025-11-24T11:44:44Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-154262 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-11-24T11:44:44Z |
| publishDate | 2015 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Kamalian, R.R. 2019-06-15T12:03:07Z 2019-06-15T12:03:07Z 2015 On one-sided interval edge colorings of biregular bipartite graphs / R.R. Kamalian // Algebra and Discrete Mathematics. — 2015. — Vol. 19, № 2. — С. 193-199. — Бібліогр.: 29 назв. — англ. 1726-3255 2010 MSC:05C15, 05C50, 05C85. https://nasplib.isofts.kiev.ua/handle/123456789/154262 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 called an interval. A
 proper edge t-coloring of a graph G is interval in the vertex
 x if the spectrum of x is an interval. A proper edge
 t-coloring φ of a graph G is interval on a subset R0
 of vertices of G, if for any x∈R0, φ is interval in
 x. A subset R of vertices of G has an i-property if there is
 a proper edge t-coloring of G which is interval on R. If G
 is a graph, and a subset R of its vertices has an i-property,
 then the minimum value of t for which there is a proper edge
 t-coloring of G interval on R is denoted by wR(G). We estimate the value of this parameter for biregular bipartite graphs in the case when R is one of the sides of a bipartition of the graph en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics On one-sided interval edge colorings of biregular bipartite graphs Article published earlier |
| spellingShingle | On one-sided interval edge colorings of biregular bipartite graphs Kamalian, R.R. |
| title | On one-sided interval edge colorings of biregular bipartite graphs |
| title_full | On one-sided interval edge colorings of biregular bipartite graphs |
| title_fullStr | On one-sided interval edge colorings of biregular bipartite graphs |
| title_full_unstemmed | On one-sided interval edge colorings of biregular bipartite graphs |
| title_short | On one-sided interval edge colorings of biregular bipartite graphs |
| title_sort | on one-sided interval edge colorings of biregular bipartite graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/154262 |
| work_keys_str_mv | AT kamalianrr ononesidedintervaledgecoloringsofbiregularbipartitegraphs |