"Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is ..."

Wenan Zang (1998)

> Home

Details and statistics

DOI: 10.1023/A:1009784115916

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Zang98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Zang98
Wenan Zang:
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. J. Comb. Optim. 2(2): 117-188 (1998)

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.