CID 2009 PARTICIPANTS
Invited speakers

Andreas Brandstädt
(University of Rostock, GERMANY)
On Independent Vertex Sets and Induced Matchings

Jan Kratochvil
(Charles University, Prague, CZECH REPUBLIC)
Distance Constrained Graph Labeling: From Frequency Assignment to Graph
Homomorphisms

Douglas F. Rall
(Furman University, Greenville, USA)
Recent Work on Vizing's Conjecture

Andre Raspaud
(Universite Bordeaux 1, Talence, FRANCE)
Star Coloring of graphs

Zsolt Tuza
(Hungarian Academy of Sciences and University of Pannonia, HUNGARY)
New types of problems on hypergraph coloring

Margit Voigt
(University of Applied Sciences Dresden, GERMANY)
List colorings of graphs

Adam P. Wojda
(AGH University of Technology, Krakow, POLAND)
Cyclic partitions of complete uniform hypergraphs (with A. Szymański)
Preliminary list of participants & talks

van Aardt Susan
(University of South Africa, South Africa)
The order of hypotraceable oriented graphs (with M. Frick, M. H. Nielsen, Peter Katrenic)
Traceability of oriented graphs (with M. Frick, J. Dunbar, P. Katrenic, M. Nielsen and O. Oellermann)
Independent sets meeting all longest paths (with M. Frick, J. Singleton)

Arkit Grzegorz
(Univerisity of Zielona Góra, Poland)

Artmann Sarah
(TU Ilmenau, Germany)
Random procedures for dominating sets in bipartite graphs

Bacsó Gábor
(Hungarian Academy of Sciences, Hungary)
The "equal sum free subset" problem (with Zs. Tuza)

Balińska Krystyna
(Technical University of Poznań, Poland)

Bielak Halina
(Maria CurieSkłodowska University, Poland)
Chromatic and flow uniqueness in a family of 2connected graphs

Borg Peter
(University of Malta, Malta)
An upper bound for the size of a smallest independent dominating set of a graph

BorowieckaOlszewska Marta
(University of Zielona Góra, Poland)

Borowiecki Mieczysław
(University of Zielona Góra, Poland)
QRamsey classes of graphs (with A. Fiedorowicz)
Coloring chip configurations on graphs and
digraphs (with J. Grytczuk, M. Pilśniak)

Borowiecki Piotr
(Gdańsk University of Technology, Poland)
Online ranking of splitgraphs (with D. Dereniowski)
Parity vertex colourings of graphs (with K. Budajová, S. Jendrol' and S. Krajčí)

Bryś Krzysztof
(Warsaw University of Technology, Poland)

Bujtás Csilla
(University of Pannonia, Hungary)
3consecutive Ccolorings of graphs (with E. Sampathkumar, Zsolt Tuza, M.S. Subramanya, Charles Dominic)

Čada Roman
(University of West Bohemia, Czech Republic)
On domination in graph products

Cichacz Sylwia
(AGH University of Science and Technology, Poland)
kcordial hypertrees (with A. Görlich)

Dehmer Matthias
(UMIT, Austria)
InformationTheoretic Characterization of Graphs

Dettlaff Magda
(Gdańsk University of Technology, Poland)
On the planarity and outerplanarity of iterated graphs (with D. Kuziak)

Dębski Michał
(Warsaw University of Technology, Poland)

Dolati Ardeshir
(Shahed University, Iran)
On the Fibonacci Number of Connected CycleSeparated Graphs

DrgasBurchardt Ewa
(University of Zielona Góra, Poland)

Dzido Tomasz
(University of Gdańsk, Poland)
Altitude of rpartite and complete graphs (with H. Furmańczyk)

Euler Reinhardt
(University of Brest, France)
On planar Toeplitz graphs (with T. Zamfirescu)

Feňovčíková Andrea
(Technical University, Košice, Slovakia)
Vertexantimagic labelings of regular graphs (with A. Ahmad, K. Ali, M. Bača, P. Kovář)

Fiedorowicz Anna
(University of Zielona Góra, Poland)
QRamsey classes of graphs (with M. Borowiecki)

Foucaud Florent
(University Bordeaux 1, France)
Bounds on the size of identifying codes for graphs of maximum degree Delta* (with R. Klasing, A. Kosowski and A. Raspaud)

Frick Marietjie
(University of South Africa, South Africa)
Traceability of oriented graphs (with S. van Aardt, J. Dunbar, P. Katrenic, M. Nielsen and O. Oellermann)
Independent sets meeting all longest paths (with S. van Aardt, J. Singleton)
The order of hypotraceable oriented graphs (with S. van Aardt, M. H. Nielsen, Peter Katrenic)

Furmańczyk Hanna
(University of Gdańsk, Poland)
Altitude of rpartite and complete graphs (with T. Dzido)

GaleanaSánchez Hortensia
(National Autonomous University of Mexico, Mexico)
Kernels by monochromatic paths and the class color digraph
kkernels in generalizations of tournaments
(with C. HernándezCruz)
Level Hypergraphs
(with M. Manrique)
In and exneighbors preserving independence: the strong arclocally semicomplete digraphs (with I. Goldfeder )
On monochromatic paths and quasitransitive subdigraphs in arccoloured digraphs
(with G. G. Guadalupe, R. RojasMonroy)
About of the structure of kernel perfect and critical kernelimperfect digraphs
(with C. Balbuena, M. Guevara)

Gaytán Gómez Guadalupe
(National Autonomous University of Mexico, Mexico)
On monochromatic paths and quasitransitive subdigraphs in arccoloured digraphs
(with H. GaleanaSánchez, R. RojasMonroy)

Goldfeder Ilan
(National Autonomous University of Mexico, Mexico)
In and exneighbors preserving independence: the strong arclocally semicomplete digraphs
(with H. GaleanaSánchez)

González Yero Ismael
(Universitat Rovira i Virgili, Spain)
On geodetic sets of a graph
(with S. Bermudo, J. A. RodríguezVelázquez, J. M. Sigarreta)

Gorgol Izolda
(Lublin University of Technology, Poland)
Turan numbers for disjoint copies of graphs

Görlich Agnieszka
(AGH University of Science and Technology, Poland)
On packable digraphs (with A. Żak)
kcordial hypertrees (with S. Cichacz)
Packing graphs without short cycles in their complements
(with A. Żak)

Guevara Mucuykak
(Universitat Politecnica de Catalunya, Spain)
About of the structure of kernel perfect and critical kernelimperfect digraphs
(with C. Balbuena, H. GaleanaSánchez)

Hałuszczak Mariusz
(University of Zielona Góra, Poland)

Harant Jochen
(TU Ilmenau, Germany)
Lower Bounds on the Independence Number in terms of Order and Size (with C. Hartleb, C. Löwenstein
D. Rautenbach, F. Regen)

Henning Michael
(University of KwaZuluNatal, South Africa)
Dominationtype parameters in cubic graphs
The dichromatic number and the acyclic disconnection in tournaments (with M. A. Henning, Ch. Löwenstein, D. Rautenbach)

HernándezCruz César
(National Autonomous University of Mexico, Mexico)
kkernels in generalizations of tournaments
(with H. GaleanaSánchez)

Idzik Adam
(IPI PAN Warsaw and UJK Kielce, Poland)
Fixed simplex property for retractable complexes (with A. Zapart)

Jakovac Marko
(University of Maribor, Slovenia)
The bchromatic number of cubic graphs (with K. Sandi)

Jastrzębski Andrzej
(Gdansk University of Technology, Poland)
Generalisation of Turan's theorem

Jendrol' Stanislav
(University of Pavol Jozef Safarik in Košice, Slovakia)
Parity vertex colourings of graphs (with P. Borowiecki, K. Budajová, and S. Krajčí)

JesseJózefczyk Katarzyna
(University of Zielona Góra, Poland)
Global secure sets in cographs

JunoszaSzaniawski Konstanty
(Warsaw University of Technology, Poland)
Counting independent sets in a clawfree graph (with M. Tuczyński)
Counting maximal independent sets in graphs with maximum degree 3 (with M. Tuczyński)
Game chromatic number of graphs with localy bounded number of cycles (with Ł. Rożej)

Kemnitz Arnfried
(Technische Universitaet Braunschweig, Germany)
dStrong Edge Colorings of Graphs (with M. Marangio)

Kędzior Anna
(AGH University of Science and Technology, Poland)
There are at least 660 universal onesixths of K_17 (with Z. Skupień)

Klešč Marián
(University of Košice, Slovakia)
On Cartesian products of cycles and their crossing numbers

Knor Martin
(Slovak University of Technology, Slovakia)
Domination in a digraph and in its reverse (with L. Niepel)

Kuziak Dorota
(Gdańsk University of Technology, Poland)
On the planarity and outerplanarity of iterated graphs (with M. Dettlaff)

Lemańska Magdalena
(Gdańsk University of Technology, Poland)
Some results for the weakly convex and convex domination numbers of a graph (with Joanna Raczek)

Llano Bernardo
(Metropolitan Autonomous University, Mexico)
The dichromatic number and the acyclic disconnection in tournaments (with M. Olsen)
2 and 3existentially closed tournaments (with R. Zuazua)

Löwenstein Christian
(TU Ilmenau, Germany)
The dichromatic number and the acyclic disconnection in tournaments (with M. A. Henning, D. Rautenbach)

Madaras Tomáš
(P.J. Šafárik University, Slovakia)
On doubly light graphs (with P. Hudák, V. Kozáková)

Małafiejska Anna
(Gdańsk University of Technology , Poland)
Interval incidence graph coloring (with R.. Janczewski, M. Małafiejski)

Małafiejski Michał
(Gdańsk University of Technology , Poland)
Interval incidence graph coloring (with R.. Janczewski, A. Małafiejska)

Manrique Martin
(National Autonomous University of Mexico, Mexico)
Level Hypergraphs
(with H. GaleanaSánchez)

Marczyk Antoni
(AGH University of Science and Technology, Poland)

Meszka Mariusz
(AGH University of Science and Technology, Poland)

Michael Jerzy
(University of Opole, Poland)

Michalak Danuta
(University of Zielona Góra, Poland)

Mihok Peter
(Technical University, Košice, Slovakia)
Generalized circular colouring of graphs

Naroski Paweł
(Warsaw University of Technology, Poland)
A Linear Time Algorithm for Finding Long Cycles in Strongly Connected 3Uniform Hypergraphs (with Z. Lonc)

Nikodem Mateusz
(AGH University of Science and Technology, Poland)
Conductors and the Frobenius vector in the SylvesterFrobenius change problem (with Z. Skupień)

Olejar Marian, Jr.
(Slovak University of Technology in Bratislava, Slovakia)
A note on star product of graphs and generalized voltage assignments

Oravcová Janka
(University of P. J. Šafárik, Slovakia)
Tight sets versus tight vectors  distance graphs versus lonely runner (with R. Soták)

Peterin Iztok
(University of Maribor, Slovenia)
Cartesian dimension of graphs

Petrosyan Petros
(Yerevan State University, Armenia)
Interval edge colorings of some products of graphs

Petrykowski Marcin
(Wrocław University, Poland)

Petryshyn Nataliya
(Warsaw University of Technology, Poland)

Pilśniak Monika
(AGH University of Science and Technology, Poland)
Coloring chip configurations on graphs and
digraphs (with M. Borowiecki, J. Grytczuk)

Prnaver Katja
(University of Ljubljana, Slovenia)

Pruchnewski Anja
(TU Ilmenau, Germany)
Random procedures for dominating sets in bipartite graphs (with S. Artmann)

Puga Isabel
((National Autonomous University of Mexico, Mexico)

Raczek Joanna
(Gdansk University of Technology, Poland)
Domination in unicyclic graphs
Some results for the weakly convex and convex domination numbers of a graph (with M. Lemańska)

RodenBowie Miranda
(University of North Alabama Florence, USA)
On the Relations between Liars' Dominating and Setsized Dominating Parameters (with P. J. Slater)

Rożej Łukasz
(Warsaw University of Technology, Poland)
Game chromatic number of graphs with locally bounded number of cycles (with K. JunoszaSzaniawski)

Rzążewski Paweł
(Warsaw University of Technology, Poland)

Schiermeyer Ingo
(Technische Universität Bergakademie Freiberg, Germany)
Rainbow connection in graphs with minimum degree three

Schrötter Štefan
(Technical University of Košice, Slovakia)
On crossing numbers of join of paths and cycles with other graphs (with M. Klešč)

Sewell J. Louis
(University of Alabama in Huntsville, USA)
Distance Independence in Graphs (with P. J. Slater)

Sidorowicz Elżbieta
(University of Zielona Góra, Poland)

Singleton Joy
(University of South Africa, South Africa)
Independent sets meeting all longest paths (with S. van Aardt, M. Frick)

Skupień Zdzisław
(AGH University of Science and Technology, Poland)
Structure of graphs with numerous dominating sets

Slater Peter
(University of Alabama in Huntsville, USA)
Complementarity and Duality of Generalized Graphical Subset Parameters

Soták Roman
(University of P. J. Šafárik, Slovakia)
Tight sets versus tight vectors  distance graphs versus lonely runner (with J. Oravcová)

Staneková Ľubica
(Slovak University of Technology Bratislava, Slovakia)
Large vertextransitive and Cayley digraphs with given degree and diameter (with Mária Ždímalová)

Tesar Marek
(Charles University, Prague, Czech Republic)

Topp Jerzy
(Gdansk University of Technology, Poland)

Tuczyński Michał
(Warsaw University of Technology, Poland)
Counting maximal independent sets in graphs with maximum degree 3 (with K. JunoszaSzaniawski)
Counting independent sets in a clawfree graph (with K. JunoszaSzaniawski)

Vanherpe JeanMarie
(Laboratoire d'Informatique Fondamentale d'Orléans, France)
On Fulkerson conjecture (with JeanLuc Fouquet)

Włoch Iwona
(Rzeszow University of Technology, Poland)
Generalized Pell numbers and their graph representations (with A. Włoch)

Woźniak Mariusz
(AGH University of Science and Technology, Poland)

Yeh Roger
(Feng Chia University, Taiwan)
The edge span of graph distance labeling (with JiWei Huang)

Zapart Anna
(Warsaw University of Technology, Poland)
Fixed simplex property for retractable complexes (with A. Idzik)

Zuazua Rita
((National Autonomous University of Mexico, Mexico)
2 and 3existentially closed tournaments (with B. Llano)

Żak Andrzej
(AGH University of Science and Technology, Poland)
Packing graphs without short cycles in their complements
(with A. Görlich)
On packable digraphs (with A. Görlich)