The Petersen graph is not 3-edge-colorable - a counting argument proof, 41(2003)

The Petersen graph is not 3-edge-colorable - a counting argument proof, 41(2003)

Avtor: Reza Naserasr, Riste Škrekovski

IMFM preprints

Reza Naserasr, Riste Škrekovski: The Petersen graph is not 3-edge-colorable - a counting argument proof, 41(2003), 41 (2003)

MegaZine3 requires FlashPlayer 9

Get Adobe Flash player

Powered by MegaZine3

0%
0%