default search action

combined dblp search
author search
venue search
publication search

ask others

"Planar graphs without adjacent cycles of length at most seven are 3-colorable."

Oleg V. Borodin, Mickaël Montassier, André Raspaud (2010)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2009.08.010

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/BorodinMR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BorodinMR10
Oleg V. Borodin, Mickaël Montassier, André Raspaud:
Planar graphs without adjacent cycles of length at most seven are 3-colorable. Discret. Math. 310(1): 167-173 (2010)

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.