"3-Connected planar graphs are 5-distinguishing colorable with two exceptions."

Gasper Fijavz, Seiya Negami, Terukazu Sano (2011)

> Home

Details and statistics

DOI: 10.26493/1855-3974.199.A0E

access: open

type: Journal Article

metadata version: 2019-03-27

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/arsmc/FijavzNS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arsmc/FijavzNS11
Gasper Fijavz, Seiya Negami, Terukazu Sano:
3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars Math. Contemp. 4(1): 165-175 (2011)

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.