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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., Ser. 1, 2000, Volume 7, Number 3, Pages 72–85 (Mi da272)  

This article is cited in 10 scientific papers (total in 10 papers)

On an algorithm for the edge coloring of multigraphs

V. A. Tashkinov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (1632 kB)

Bibliographic databases:
UDC: 519.174
Received: 19.04.2000

Citation: V. A. Tashkinov, “On an algorithm for the edge coloring of multigraphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000), 72–85

Citation in format AMSBIB
\Bibitem{Tas00}
\by V.~A.~Tashkinov
\paper On an algorithm for the edge coloring of multigraphs
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2000
\vol 7
\issue 3
\pages 72--85
\mathnet{http://mi.mathnet.ru/da272}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1794647}
\zmath{https://zbmath.org/?q=an:0955.05036}


Linking options:
  • http://mi.mathnet.ru/eng/da272
  • http://mi.mathnet.ru/eng/da/v7/s1/i3/p72

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Goldberg M.K., “Clusters in a multigraph with elevated density”, Electron J Combin, 14:1 (2007), R10  mathscinet  zmath  isi
    2. Scheide D., Stiebitz M., “On Vizing's bound for the chromatic index of a multigraph”, Discrete Math, 309:15 (2009), 4920–4925  crossref  mathscinet  zmath  isi  scopus
    3. McDonald J.M., “Achieving maximum chromatic index in multigraphs”, Discrete Math, 309:8 (2009), 2077–2084  crossref  mathscinet  zmath  isi  scopus
    4. Scheide D., Stiebitz M., “Vizing's Coloring Algorithm and the Fan Number”, J Graph Theory, 65:2 (2010), 115–138  crossref  mathscinet  zmath  isi  scopus
    5. Scheide D., “Graph edge colouring: Tashkinov trees and Goldberg's conjecture”, Journal of Combinatorial Theory Series B, 100:1 (2010), 68–96  crossref  mathscinet  zmath  isi  scopus
    6. Chen G., Yu X., Zang W., “Approximating the chromatic index of multigraphs”, J Comb Optim, 21:2 (2011), 219–246  crossref  mathscinet  zmath  isi  scopus
    7. McDonald J.M., “On a Theorem of Goldberg”, J Graph Theory, 68:1 (2011), 8–21  crossref  mathscinet  zmath  isi  scopus
    8. Haxell P., McDonald J., “On characterizing Vizing's edge colouring bound”, J Graph Theory, 69:2 (2012), 160–168  crossref  mathscinet  zmath  isi  scopus
    9. Haxell P.E., Kierstead H.A., “Edge Coloring Multigraphs Without Small Dense Subsets”, Discrete Math., 338:12 (2015), 2502–2506  crossref  mathscinet  zmath  isi  scopus
    10. Chen G., Gao Yu., Kim R., Postle L., Shan S., “Chromatic Index Determined By Fractional Chromatic Index”, J. Comb. Theory Ser. B, 131 (2018), 85–108  crossref  mathscinet  zmath  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:304
    Full text:129

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020