"A Note on the Complexity of Computing the Smallest Four-Coloring of Planar ..."

André Große, Jörg Rothe, Gerd Wechsung (2001)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-01-10

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/cs-CC-0106045
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-0106045
André Große, Jörg Rothe, Gerd Wechsung:
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs. CoRR cs.CC/0106045 (2001)

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.