مرکز منطقه ای اطلاع رساني علوم و فناوري - The Petersen graph is not 3-edge-colorable

Title of article :

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

Author/Authors :

Reza Naserasr، نويسنده , , Riste ?krekovski، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2003

Pages :

From page :

325

To page :

326

Abstract :

We give a new proof that the Petersen graph is not 3-edge-colorable.

Keywords :

Petersen graph , Hamiltonian cycle , Edge coloring

Journal title :

Discrete Mathematics

Serial Year :

2003

Journal title :

Discrete Mathematics

Record number :

949194

Link To Document :