|
|
Prikladnaya Diskretnaya Matematika, 2011, Number 3(13), Pages 85–91
(Mi pdm338)
|
 |
|
 |
This article is cited in 1 scientific paper (total in 1 paper)
Applied Graph Theory
Interval on one party regular edge 5-coloring of bipatite graph
A. M. Magomedov, T. A. Magomedov
Daghestan State University, Makhachkala, Russia
Abstract:
For a bipartite graph $G=(X,Y,E)$ where the degree of any vertex in $X$ equals 2 and maximal degree of the vertex in $Y$ equals 5, conditions for existence of regular edge 5-coloring being an interval on $X$
Keywords:
bipatite graph, edge-coloring, NP-completeness.
Citation:
A. M. Magomedov, T. A. Magomedov, “Interval on one party regular edge 5-coloring of bipatite graph”, Prikl. Diskr. Mat., 2011, no. 3(13), 85–91
Linking options:
https://www.mathnet.ru/eng/pdm338 https://www.mathnet.ru/eng/pdm/y2011/i3/p85
|
| Statistics & downloads: |
| Abstract page: | 207 | | Full-text PDF : | 74 | | References: | 36 | | First page: | 1 |
|
Citation in format AMSBIB
Contact us: