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.
12 program<br />
8.00- 9.00 breakfast<br />
Chair: Zdzis̷law Skupień<br />
FRIDAY 26.09.03<br />
9.00- 9.20 A. Pawe̷l Wojda, Aneta Dudek, Gyula Y. Katona Jr.<br />
Hamiltonian path saturated graphs with minimum size 23<br />
9.20- 9.40 Irmina A. Zio̷lo, A. Pawe̷l Wojda, Mariusz Woźniak<br />
On self-complementary subgraphs of (N, N)-graphs 51<br />
9.40-10.00 Konstanty Junosza-Szaniawski, Adam Idzik<br />
Combinatorial lemmas for nonoriented pseudomanifolds 35<br />
10.00-10.30 coffee break<br />
10.30-10.50 Mirko Horňák, Zuzana Kocková<br />
On complete tripartite graphs arbitrarily decomposable<br />
into closed trails 33<br />
10.50-11.10 Krzysztof Bryś<br />
A complete proof of a Holyer problem<br />
11.10-11.30 Marián Klešč<br />
On the crossing numbers of products of small graphs 38<br />
11.30-11.50 Hanna Furmańczyk<br />
Equitable coloring of graph products 26<br />
11.50-12.10 coffee break<br />
Chair: Peter Mihók<br />
12.10-12.30 Maria Kwaśnik, Monika Perl<br />
Extendability <strong>and</strong> near perfectness of graph products 41<br />
12.30-12.50 Magdalena Kucharska<br />
On (k, l)-kernel perfectness of special classes of digraphs 39<br />
12.50-13.10 Jerzy Michael, Zyta Dziechcińska-Halamoda, Zofia Majcher,<br />
Zdzis̷law Skupień<br />
The uniquely one-one realizable degree sets by minimum<br />
irregular digraphs 25<br />
13.10-13.30 PROBLEM SESSION<br />
13.45-14.30 lunch<br />
15.00-15.15 departure to Zielona Góra
Change language