CID 2003 Abstracts - Colourings, Independence and Domination
CID 2003 Abstracts - Colourings, Independence and Domination
CID 2003 Abstracts - Colourings, Independence and Domination
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
10 program<br />
8.00- 9.00 breakfast<br />
Chair: Zsolt Tuza<br />
THURSDAY 25.09.03<br />
9.00-10.00 Hal Kierstead<br />
Competitive graph coloring 37<br />
10.00-10.30 coffee break<br />
10.30-10.50 Mieczys̷law Borowiecki, Elżbieta Sidorowicz<br />
Game partitions of graphs 16<br />
10.50-11.10 Mieczys̷law Borowiecki, Elżbieta Sidorowicz<br />
Game list colouring of graphs 17<br />
11.10-11.30 Krystyna T. Balińska, Tomasz Lubiński, K.T. Zwierzyński<br />
An algorithm for generating regular graphs 13<br />
11.30-11.50 Mihyun Kang, Manuel Bodirsky, Clemens Gröpl<br />
Generating labeled cubic planar graphs uniformly at r<strong>and</strong>om 15<br />
11.50-12.10 coffee break<br />
Chair: Izak Broere<br />
12.10-12.30 Maciej M. Sys̷lo, Anna B. Kwiatkowska<br />
Some families of posets of page number 2<br />
12.30-12.50 Harald Gropp<br />
Colouring of configurations 30<br />
12.50-13.10 Jaros̷law Grytczuk<br />
Happy colorings of hypergraph couples 31<br />
13.10-13.30 Ewa ̷Lazuka, Ewa Drgas-Burchardt<br />
On panchromatic colorings of hypergraphs 22<br />
13.45-14.30 lunch
Change language