CID 2003 Abstracts - Colourings, Independence and Domination
CID 2003 Abstracts - Colourings, Independence and Domination
CID 2003 Abstracts - Colourings, Independence and Domination
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
8 program<br />
8.00- 9.00 breakfast<br />
Chair: Maciej M. Sys̷lo<br />
TUESDAY 23.09.03<br />
9.00-10.00 Zdzis̷law Skupień<br />
Trees with numerous extremal subforests 50<br />
10.00-10.30 coffee break<br />
10.30-10.50 Stanislav Jendrol’, Peter Jacko<br />
Distance coloring of the hexagonal lattice 36<br />
10.50-11.10 S<strong>and</strong>i Klavžar, Sylvain Gravier, Michel Mollard<br />
Sierpiński graphs: L(2, 1)-colorings <strong>and</strong> perfect codes 29<br />
11.10-11.30 Adam Idzik<br />
Estimation of cut-vertices in edge-coloured complete graphs 34<br />
11.30-11.50 Anna Fiedorowicz, Ewa Drgas-Burchardt<br />
Additive hereditary properties of hypergraphs based on<br />
chromatic sums of hypergraphs 21<br />
11.50-12.10 coffee break<br />
Chair: Hal Kierstead<br />
12.10-12.30 Izak Broere, Bonita S. Wilson<br />
Partition problems of planar graphs 19<br />
12.30-12.50 Peter Mihók<br />
Characteristic of hereditary graph properties 44<br />
12.50-13.10 Gabriel Semanišin<br />
On generalized k-degenerate graphs 49<br />
13.10-13.30 Boštjan Brešar, S<strong>and</strong>i Klavžar<br />
Square-free colorings of graphs 18<br />
13.45-14.30 lunch
Change language