Loading [MathJax]/jax/output/CommonHTML/jax.js
Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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


Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1999, Volume 6, Issue 4, Pages 20–35 (Mi da325)  

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

Acyclic coloring of 1-planar graphs

O. V. Borodina, A. V. Kostochkab, A. Raspaudc, E. Sopenac

a Novosibirsk State University
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
c Université Bordeaux 1
Received: 16.02.1999
Bibliographic databases:
UDC: 519.1
Language: Russian
Citation: O. V. Borodin, A. V. Kostochka, A. Raspaud, E. Sopena, “Acyclic coloring of 1-planar graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999), 20–35
Citation in format AMSBIB
\Bibitem{BorKosRas99}
\by O.~V.~Borodin, A.~V.~Kostochka, A.~Raspaud, E.~Sopena
\paper Acyclic coloring of 1-planar graphs
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1999
\vol 6
\issue 4
\pages 20--35
\mathnet{http://mi.mathnet.ru/da325}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1760727}
\zmath{https://zbmath.org/?q=an:0931.05032}
Linking options:
  • https://www.mathnet.ru/eng/da325
  • https://www.mathnet.ru/eng/da/v6/s1/i4/p20
  • This publication is cited in the following 11 articles:
    1. Borodin O.V., “Colorings of Plane Graphs: a Survey”, Discrete Math., 313:4 (2013), 517–539  crossref  mathscinet  zmath  isi  elib  scopus
    2. Korzhik V.P., Mohar B., “Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing”, J. Graph Theory, 72:1 (2013), 30–71  crossref  mathscinet  zmath  isi  elib  scopus
    3. Korzhik V.P., “Proper 1-Immersions of Graphs Triangulating the Plane”, Discrete Math., 313:23 (2013), 2673–2686  crossref  mathscinet  zmath  isi  elib  scopus
    4. Czap J., Hudak D., “1-Planarity of Complete Multipartite Graphs”, Discrete Appl. Math., 160:4-5 (2012), 505–512  crossref  mathscinet  zmath  isi  elib  scopus
    5. Yadav K., Varagani S., Kothapalli K., Venkaiah V.Ch., “Acyclic vertex coloring of graphs of maximum degree 5”, Discrete Math, 311:5 (2011), 342–348  crossref  mathscinet  zmath  isi  elib  scopus
    6. Korzhik V.P., Mohar B., “Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing”, Graph Drawing, Lecture Notes in Computer Science, 5417, 2009, 302–312  crossref  mathscinet  zmath  isi
    7. Korzhik V.P., “Minimal non-1-planar graphs”, Discrete Math, 308:7 (2008), 1319–1327  crossref  mathscinet  zmath  isi  elib  scopus
    8. Radoicic R., Toth G., “The discharging method in combinatorial geometry and the Pach-Sharir conjecture”, Surveys on Discrete and Computational Geometry: Twenty Years Later, Contemporary Mathematics Series, 453, 2008, 319–342  crossref  mathscinet  zmath  isi
    9. Fabrici I., Madaras T., “The structure of 1-planar graphs”, Discrete Math, 307:7–8 (2007), 854–865  crossref  mathscinet  zmath  isi  scopus
    10. Skulrattanakulchai S., “Acyclic colorings of subcubic graphs”, Inform Process Lett, 92:4 (2004), 161–167  crossref  mathscinet  zmath  isi  scopus
    11. O. V. Borodin, A. V. Kostochka, A. Raspaud, E. Sopena, “Acyclic k-strong coloring of maps on surfaces”, Math. Notes, 67:1 (2000), 29–35  mathnet  crossref  crossref  mathscinet  zmath  isi
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:489
    Full-text PDF :103
    References:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025