RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Subscription
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Uspekhi Mat. Nauk, 1968, Volume 23, Issue 6(144), Pages 117–134 (Mi umn5685)  

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

Some unsolved problems in graph theory

V. G. Vizing


Full text: PDF file (2227 kB)
References: PDF file   HTML file

English version:
Russian Mathematical Surveys, 1968, 23:6, 125–141

Bibliographic databases:

UDC: 519.9
MSC: 05C60, 05C15, 05C30, 05C80

Citation: V. G. Vizing, “Some unsolved problems in graph theory”, Uspekhi Mat. Nauk, 23:6(144) (1968), 117–134; Russian Math. Surveys, 23:6 (1968), 125–141

Citation in format AMSBIB
\Bibitem{Viz68}
\by V.~G.~Vizing
\paper Some unsolved problems in graph theory
\jour Uspekhi Mat. Nauk
\yr 1968
\vol 23
\issue 6(144)
\pages 117--134
\mathnet{http://mi.mathnet.ru/umn5685}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=240000}
\zmath{https://zbmath.org/?q=an:0192.60502|0177.52301}
\transl
\jour Russian Math. Surveys
\yr 1968
\vol 23
\issue 6
\pages 125--141
\crossref{https://doi.org/10.1070/RM1968v023n06ABEH001252}


Linking options:
  • http://mi.mathnet.ru/eng/umn5685
  • http://mi.mathnet.ru/eng/umn/v23/i6/p117

    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. Stanley Fiorini, “Some remarks on a paper by Vizing on critical graphs”, Math Proc Camb Phil Soc, 77:3 (1975), 475  crossref  mathscinet  zmath
    2. D. V. Znoiko, “Free products of networks and free symmetrizers of graphs”, Math. USSR-Sb., 27:4 (1975), 463–480  mathnet  crossref  mathscinet  zmath
    3. L. I. Kicha, E. I. Litvak, Ya. I. Tartakovskii, “Ob odnom priznake izomorfizma odnorodnykh grafov”, UMN, 30:1(181) (1975), 237–238  mathnet  mathscinet  zmath
    4. Hian Poh Yap, “On graphs critical with respect to edge-colourings”, Discrete Mathematics, 37:2-3 (1981), 289  crossref
    5. Michael J. Plantholt, “The chromatic index of graphs with large maximum degree”, Discrete Mathematics, 47 (1983), 91  crossref
    6. A.J.W. Hilton, H.R. Hind, “The total chromatic number of graphs having large maximum degree”, Discrete Mathematics, 117:1-3 (1993), 127  crossref
    7. H.R. Hind, “Recent developments in total colouring”, Discrete Mathematics, 125:1-3 (1994), 211  crossref
    8. Abdón Sánchez-Arroyo, “A new upper bound for total colourings of graphs”, Discrete Mathematics, 138:1-3 (1995), 375  crossref
    9. K Chew, “Total chromatic number of regular graphs of odd order and high degree”, Discrete Mathematics, 154:1-3 (1996), 41  crossref  elib
    10. Stephen A. Wong, “Extending fixed vertex-colourings to total colourings”, Discrete Mathematics, 177:1-3 (1997), 295  crossref
    11. K.H. Chew, “Total chromatic number of graphs of odd order and high degree”, Discrete Mathematics, 205:1-3 (1999), 39  crossref
    12. Michael Molloy, Bruce Reed, “Near-optimal list colorings”, Random Struct Alg, 17:3-4 (2000), 376  crossref  mathscinet  zmath  isi  elib
    13. V.A. Bojarshinov, “Edge and total coloring of interval graphs”, Discrete Applied Mathematics, 114:1-3 (2001), 23  crossref
    14. Dezheng Xie, Wanlian Yang, “The total chromatic number of graphs of even order and high degree”, Discrete Mathematics, 271:1-3 (2003), 295  crossref
    15. Lian-ying Miao, Shi-you Pang, Jian-liang Wu, “An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree”, Discrete Mathematics, 271:1-3 (2003), 321  crossref
    16. Stefan Grünewald, Eckhard Steffen, “Independent sets and 2-factors in edge-chromatic-critical graphs”, J Graph Theory, 45:2 (2004), 113  crossref  mathscinet  zmath  isi
    17. Rong Luo, Yue Zhao, “A note on Vizing's independence number conjecture of edge chromatic critical graphs”, Discrete Mathematics, 306:15 (2006), 1788  crossref
    18. Wilfried Imrich, Iztok Peterin, “Recognizing Cartesian products in linear time”, Discrete Mathematics, 307:3-5 (2007), 472  crossref
    19. DeZheng Xie, WanNian Yang, “The total chromatic number of regular graphs of high degree”, Sci China Ser A, 2009  crossref  mathscinet  isi
    20. N. V. Gravin, “Construction of a spanning tree with many leaves”, J. Math. Sci. (N. Y.), 179:5 (2011), 592–600  mathnet  crossref
    21. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno, “A tight upper bound on the ()-total labeling number of outerplanar graphs”, Journal of Discrete Algorithms, 2011  crossref
    22. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno, “The -total labeling problem for trees”, Discrete Mathematics, 312:8 (2012), 1407  crossref
    23. Tom Coker, Karen Johannson, “The adjacent vertex distinguishing total chromatic number”, Discrete Mathematics, 2012  crossref
    24. Xiang'en Chen, Yuping Gao, Bing Yao, “Not necessarily proper total colourings which are adjacent vertex distinguishing”, International Journal of Computer Mathematics, 2013, 1  crossref
    25. Seth Pettie, Hsin-Hao Su, “Distributed Coloring Algorithms for Triangle-Free Graphs”, Information and Computation, 2014  crossref
  • Успехи математических наук Russian Mathematical Surveys
    Number of views:
    This page:3038
    Full text:1087
    References:94
    First page:4

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