Open AccessAn Original Speech Around the Difficult Part of the Berge Conjecture (Solved by Chudnovsky, Robertson, Seymour and Thomas)
Author(s) -
Ikorong Anouk Gilbert Nemron
Publication year - 2010
Publication title -
communications in mathematics and applications
Language(s) - English
Resource type - Journals
eISSN - 0976-5905
pISSN - 0975-8607
DOI - 10.26713/cma.v1i3.126
Subject(s) - combinatorics , mathematics , conjecture , perfect graph , graph , strong perfect graph theorem , discrete mathematics , graph power , line graph , pathwidth