"The Petersen graph is not 3-edge-colorable--a new proof."

Reza Naserasr, Riste Skrekovski (2003)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(03)00138-9

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/NaserasrS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/NaserasrS03
Reza Naserasr, Riste Skrekovski:
The Petersen graph is not 3-edge-colorable--a new proof. Discret. Math. 268(1-3): 325-326 (2003)

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.