Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Oleg V. Borodin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alexei N. Glebov

> Home > Persons > Oleg V. Borodin

Publications

2012
[j60]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/BorodinGJ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/BorodinGJ12
Oleg V. Borodin, Alexei N. Glebov, Tommy R. Jensen:
A step towards the strong version of Havel's three color conjecture. J. Comb. Theory, Ser. B 102(6): 1295-1320 (2012)
2011
[j57]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/BorodinG11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/BorodinG11
Oleg V. Borodin, Alexei N. Glebov:
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. J. Graph Theory 66(1): 1-31 (2011)
2010
[j52]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/BorodinGR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BorodinGR10
Oleg V. Borodin, Alexei N. Glebov, André Raspaud:
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discret. Math. 310(20): 2584-2594 (2010)
2009
[j45]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/BorodinGMR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/BorodinGMR09
Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud:
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Comb. Theory, Ser. B 99(4): 668-673 (2009)
2007
[j41]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/BorodinBGH07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/BorodinBGH07
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel:
A new upper bound on the cyclic chromatic number. J. Graph Theory 54(1): 58-72 (2007)
2005
[j39]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/BorodinGRS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/BorodinGRS05
Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour:
Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory, Ser. B 93(2): 303-311 (2005)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.