Object
Title: On one-sided interval edge coloringsof biregular bipartite graphs
Abstract:
A proper edget-coloring of a graphGis a coloringof edges ofGwith colors 1,2,:::,tsuch that all colors are used,and no two adjacent edges receive the same color. The set of colorsof edges incident with a vertexxis called a spectrum ofx. Anynonempty subset of consecutive integers is called an interval. Aproper edget-coloring of a graphGis interval in the vertexxif thespectrum ofxis an interval. A proper edget-coloringφof a graphGis interval on a subsetR0of vertices ofG, if for anyx∈R0,φisinterval inx. A subsetRof vertices ofGhas ani-property if thereis a proper edget-coloring ofGwhich is interval onR. IfGis agraph, and a subsetRof its vertices has ani-property, then theminimum value oftfor which there is a proper edget-coloring ofGinterval onRis denoted bywR(G). We estimate the value of thisparameter for biregular bipartite graphs in the case whenRis oneof the sides of a bipartition of the graph.
Date submitted:
Date of publication:
Identifier:
oai:noad.sci.am:135987
ISSN:
Language:
Journal or Publication Title:
Algebra and Discrete Mathematics
Volume:
Number:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Indexing:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
Mar 3, 2021
In our library since:
Jul 28, 2020
Number of object content hits:
26
All available object's versions:
https://noad.sci.am/publication/149600
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Rafayel Ruben Kamalian, On one-sided interval edge coloringsof biregular bipartite graphs | Mar 3, 2021 |
