CID 2003 PARTICIPANTS
Invited speakers
List of participants & talks
-
Krystyna Balińska
(Poznań, Poland)
An algorithm for generating regular graphs
-
Małgorzata Bednarska
(Poznań, Poland)
-
Halina Bielak
(Lublin, Poland)
Ramsey numbers for some disjoint cycles
-
Jacek Bojarski
(Zielona Góra, Poland)
-
Mieczysław Borowiecki
(Zielona Góra, Poland)
Game partitions of graphs
-
Piotr Borowiecki
(Zielona Góra, Poland)
-
Bostjan Brešar
(Maribor, Slovenia)
Square-free colorings of graphs
-
Izak Broere
(Johannesburg, Republic of South Africa)
Partition problems of planar graphs
-
Krzysztof Bryś
(Warszawa, Poland)
A complete proof of a Holyer problem
-
Stanisław Bylka
(Warszawa, Poland)
Arithmetically maximal independent sets in infinite graphs
-
Ewa Drgas-Burchardt
(Zielona Góra, Poland)
-
Tomasz Dzido
(Gdańsk, Poland)
New values and bounds for multicolor Ramsey numbers
-
Zyta Dziechcińska-Halamoda
(Opole, Poland)
-
Anna Fiedorowicz
(Zielona Góra, Poland)
Additive hereditary properties of hypergraphs based on chromatic sums of hypergraphs
-
Hanna Furmańczyk
(Gdańsk, Poland)
Equitable coloring of graph products
-
Izolda Gorgol
(Lublin, Poland)
Induced Ramsey classes
-
Jarosław Grytczuk
(Zielona Góra, Poland)
Happy colorings of hypergraph couples
-
Mariusz Hałuszczak
(Zielona Góra, Poland)
-
Jochen Harant
(Ilmenau, Germany)
On domination in graphs
-
Michael A. Henning
(Pietermaritzburg, South Africa)
Graphs with large double domination number
-
Mirko Horňák
(Košice, Slovak Republic)
On complete tripartite graphs arbitrarily decomposable into closed
trails
-
Stanislav Jendrol'
(Košice, Slovak Republic)
Distance coloring of the hexagonal lattice
-
Konstanty Junosza-Szaniawski
(Warszawa, Poland)
Combinatorial lemmas for nonoriented pseudomanifolds
-
Mihyun Kang
(Berlin, Germany)
Generating labeled cubic planar graphs uniformly at random
-
Hal Kierstead
(Tempe, USA)
Competitive graph coloring (invited talk)
-
Sandi Klavžar
(Maribor, Slovenia)
Sierpiński graphs: L(2,1)-colorings and perfect codes
-
Marián Klešč
(Košice, Slovak Republic)
On the crossing numbers of products of small graphs
-
Magdalena Kucharska
(Szczecin, Poland)
On (k,l)-kernel perfectness of special classes of digraphs
-
Anna Beata Kwiatkowska
(Toruń, Poland)
Some families of posets of page number 2
-
Magdalena Lemańska
(Gdańsk, Poland)
Dominating numbers in graphs with removed edge or set of edges
-
Tomasz Lubiński
(Poznań, Poland)
An algorithm for generating regular graphs
-
Ewa Łazuka
(Lublin, Poland)
On panchromatic colorings of hypergraphs
-
Zofia Majcher
(Opole, Poland)
-
Jerzy Michael
(Opole, Poland)
The uniquely one-one realizable degree sets by minimum irregular digraphs
-
Danuta Michalak
(Zielona Góra, Poland)
Dominating bipartite subgraphs in graphs
-
Peter Mihók
(Košice, Slovak Republic)
Characteristic of hereditary graph properties
-
Monika Perl
(Szczecin, Poland)
Extendability and near perfectness of graph products
-
Monika Pszczoła
(Warszawa, Poland)
-
Douglas F. Rall
(Greenville, USA)
Domination and independence in graph products (invited talk)
-
Andrzej Ruciński
(Poznań, Poland)
-
Ingo Schiermeyer
(Freiberg, Germany)
Ramsey and rainbow colourings (invited talk)
-
Gabriel Semanišin
(Košice, Slovak Republic)
On generalized k-degenerate graphs
-
Elżbieta Sidorowicz
(Zielona Góra, Poland)
Game list colouring of graphs
-
Zdzisław Skupień
(Kraków, Poland)
Trees with numerous extremal subforests (invited talk)
-
Maciej M. Sysło
(Wrocław, Poland)
Some families of posets of page number 2
-
Alina Szelecka
(Zielona Góra, Poland)
-
Edyta Szymańska
(Poznań, Poland)
-
Zsolt Tuza
(Budapest, Hungary)
On the structure of dominating subgraphs (invited talk)
-
Bartosz Wiszniewski
(Zielona Góra, Poland)
-
A. Paweł Wojda
(Kraków, Poland)
Hamiltonian path saturated graphs with minimum size
-
Adam Wysoczański
(Zielona Góra, Poland)
