RUS
ENG
Full version
JOURNALS
// Prikladnaya Diskretnaya Matematika
// Archive
Prikl. Diskr. Mat.,
2011
Number 3(13),
Pages
85–91
(Mi pdm338)
This article is cited 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.
UDC:
519.1
+
519.8
Fulltext:
PDF file (582 kB)
References
Cited by
©
Steklov Math. Inst. of RAS
, 2025