Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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
Full-text PDF (582 kB) Citations (1)
References:
PDF
HTML
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.
Document Type: Article
UDC: 519.1+519.8
Language: Russian
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
Citation in format AMSBIB
\Bibitem{MagMag11}
\by A.~M.~Magomedov, T.~A.~Magomedov
\paper Interval on one party regular edge 5-coloring of bipatite graph
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 3(13)
\pages 85--91
\mathnet{http://mi.mathnet.ru/pdm338}
Linking options:
  • https://www.mathnet.ru/eng/pdm338
  • https://www.mathnet.ru/eng/pdm/y2011/i3/p85
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024