Domov > Obvestila > R. Skrekovski: Planar graphs without 3-,7-,8-cycles are 3-choosable

R. Skrekovski: Planar graphs without 3-,7-,8-cycles are 3-choosable

Datum objave: 30. 9. 2008
Vir: Seminar za teorijo grafov in algoritme
Thursday, October 2, 2008, at 12:15 in room 3.07, Jadranska 21