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,\ldots,t\) such that all colors are used, and notwo adjacent edges receive the same color. The set of colors ofedges incident with a vertex \(x\) is called a spectrum of \(x\). Anynonempty subset of consecut...
Saved in:
| Date: | 2015 |
|---|---|
| Main Author: | Kamalian, Rafayel Ruben |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2015
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/46 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
On one-sided interval edge colorings of biregular bipartite graphs
by: Kamalian, Rafayel Ruben
Published: (2015) -
On n-stars in colorings and orientations of graphs
by: Protasov, Igor Vladimirovich
Published: (2016) -
On n-stars in colorings and orientations of graphs
by: Protasov, Igor Vladimirovich
Published: (2016) -
Color-detectors of hypergraphs
by: Protasov, I. V., et al.
Published: (2018) -
On the edge-Wiener index of the disjunctive product of simple graphs
by: Azari, M., et al.
Published: (2020)