"Planar graphs without cycles of length from 4 to 7 are 3-colorable."

Oleg V. Borodin et al. (2005)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2004.11.001

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  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 B 93(2): 303-311 (2005)

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.