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.
contents 3<br />
CONTENTS<br />
Preliminary Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7<br />
<strong>Abstracts</strong><br />
K.T. Balińska, T. Lubiński, K.T. Zwierzyński<br />
An algorithm for generating regular graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13<br />
H. Bielak<br />
Ramsey numbers for some disjoint cycles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14<br />
M. Bodirsky, C. Gröpl, M. Kang<br />
Generating labeled cubic planar graphs uniformly at r<strong>and</strong>om. . . . . . . . . . . . . . .15<br />
M. Borowiecki, E. Sidorowicz<br />
Game partitions of graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16<br />
M. Borowiecki, E. Sidorowicz<br />
Game list colouring of graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17<br />
B. Brešar, S. Klavžar<br />
Square-free colorings of graphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .18<br />
I. Broere, B.S. Wilson<br />
Partition problems of planar graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19<br />
S. Bylka<br />
Arithmetically maximal independent sets in infinite graphs . . . . . . . . . . . . . . . . 20<br />
E. Drgas-Burchardt, A. Fiedorowicz<br />
Additive hereditary properties of hypergraphs based on chromatic sums<br />
of hypergraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21<br />
E. Drgas-Burchardt, E. ̷Lazuka<br />
On panchromatic colorings of hypergraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22<br />
A. Dudek, G.Y. Katona Jr., A.P. Wojda<br />
Hamiltonian path saturated graphs with minimum size . . . . . . . . . . . . . . . . . . . . 23<br />
T. Dzido<br />
New values <strong>and</strong> bounds for multicolor Ramsey numbers . . . . . . . . . . . . . . . . . . . . 24<br />
Z. Dziechcińska-Halamoda, Z. Majcher, J. Michael, Z. Skupień<br />
The uniquely one-one realizable degree sets by minimum irregular<br />
digraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .25
Change language