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

  1. 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)
  2. Arkit Grzegorz (Univerisity of Zielona Góra, Poland)
  3. Artmann Sarah (TU Ilmenau, Germany)
    Random procedures for dominating sets in bipartite graphs
  4. Bacsó Gábor (Hungarian Academy of Sciences, Hungary)
    The "equal sum free subset" problem (with Zs. Tuza)
  5. Balińska Krystyna (Technical University of Poznań, Poland)
  6. Bielak Halina (Maria Curie-Skłodowska University, Poland)
    Chromatic and flow uniqueness in a family of 2-connected graphs
  7. Borg Peter (University of Malta, Malta)
    An upper bound for the size of a smallest independent dominating set of a graph
  8. Borowiecka-Olszewska Marta (University of Zielona Góra, Poland)
  9. Borowiecki Mieczysław (University of Zielona Góra, Poland)
    Q-Ramsey classes of graphs (with A. Fiedorowicz)
    Coloring chip configurations on graphs and digraphs (with J. Grytczuk, M. Pilśniak)
  10. Borowiecki Piotr (Gdańsk University of Technology, Poland)
    On-line ranking of split-graphs (with D. Dereniowski)
    Parity vertex colourings of graphs (with K. Budajová, S. Jendrol' and S. Krajčí)
  11. Bryś Krzysztof (Warsaw University of Technology, Poland)
  12. Bujtás Csilla (University of Pannonia, Hungary)
    3-consecutive C-colorings of graphs (with E. Sampathkumar, Zsolt Tuza, M.S. Subramanya, Charles Dominic)
  13. Čada Roman (University of West Bohemia, Czech Republic)
    On domination in graph products
  14. Cichacz Sylwia (AGH University of Science and Technology, Poland)
    k-cordial hypertrees (with A. Görlich)
  15. Dehmer Matthias (UMIT, Austria)
    Information-Theoretic Characterization of Graphs
  16. Dettlaff Magda (Gdańsk University of Technology, Poland)
    On the planarity and outerplanarity of iterated graphs (with D. Kuziak)
  17. Dębski Michał (Warsaw University of Technology, Poland)
  18. Dolati Ardeshir (Shahed University, Iran)
    On the Fibonacci Number of Connected Cycle-Separated Graphs
  19. Drgas-Burchardt Ewa (University of Zielona Góra, Poland)
  20. Dzido Tomasz (University of Gdańsk, Poland)
    Altitude of r-partite and complete graphs (with H. Furmańczyk)
  21. Euler Reinhardt (University of Brest, France)
    On planar Toeplitz graphs (with T. Zamfirescu)
  22. Feňovčíková Andrea (Technical University, Košice, Slovakia)
    Vertex-antimagic labelings of regular graphs (with A. Ahmad, K. Ali, M. Bača, P. Kovář)
  23. Fiedorowicz Anna (University of Zielona Góra, Poland)
    Q-Ramsey classes of graphs (with M. Borowiecki)
  24. 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)
  25. 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)
  26. Furmańczyk Hanna (University of Gdańsk, Poland)
    Altitude of r-partite and complete graphs (with T. Dzido)
  27. Galeana-Sánchez Hortensia (National Autonomous University of Mexico, Mexico)
    Kernels by monochromatic paths and the class color digraph
    k-kernels in generalizations of tournaments (with C. Hernández-Cruz)
    Level Hypergraphs (with M. Manrique)
    In- and ex-neighbors preserving independence: the strong arc-locally semicomplete digraphs (with I. Goldfeder )
    On monochromatic paths and quasi-transitive subdigraphs in arc-coloured digraphs (with G. G. Guadalupe, R. Rojas-Monroy)
    About of the structure of kernel perfect and critical kernel-imperfect digraphs (with C. Balbuena, M. Guevara)
  28. Gaytán Gómez Guadalupe (National Autonomous University of Mexico, Mexico)
    On monochromatic paths and quasi-transitive subdigraphs in arc-coloured digraphs (with H. Galeana-Sánchez, R. Rojas-Monroy)
  29. Goldfeder Ilan (National Autonomous University of Mexico, Mexico)
    In- and ex-neighbors preserving independence: the strong arc-locally semicomplete digraphs (with H. Galeana-Sánchez)
  30. González Yero Ismael (Universitat Rovira i Virgili, Spain)
    On geodetic sets of a graph (with S. Bermudo, J. A. Rodríguez-Velázquez, J. M. Sigarreta)
  31. Gorgol Izolda (Lublin University of Technology, Poland)
    Turan numbers for disjoint copies of graphs
  32. Görlich Agnieszka (AGH University of Science and Technology, Poland)
    On packable digraphs (with A. Żak)
    k-cordial hypertrees (with S. Cichacz)
    Packing graphs without short cycles in their complements (with A. Żak)
  33. Guevara Mucuy-kak (Universitat Politecnica de Catalunya, Spain)
    About of the structure of kernel perfect and critical kernel-imperfect digraphs (with C. Balbuena, H. Galeana-Sánchez)
  34. Hałuszczak Mariusz (University of Zielona Góra, Poland)
  35. 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)
  36. Henning Michael (University of KwaZulu-Natal, South Africa)
    Domination-type parameters in cubic graphs
    The dichromatic number and the acyclic disconnection in tournaments (with M. A. Henning, Ch. Löwenstein, D. Rautenbach)
  37. Hernández-Cruz César (National Autonomous University of Mexico, Mexico)
    k-kernels in generalizations of tournaments (with H. Galeana-Sánchez)
  38. Idzik Adam (IPI PAN Warsaw and UJK Kielce, Poland)
    Fixed simplex property for retractable complexes (with A. Zapart)
  39. Jakovac Marko (University of Maribor, Slovenia)
    The b-chromatic number of cubic graphs (with K. Sandi)
  40. Jastrzębski Andrzej (Gdansk University of Technology, Poland)
    Generalisation of Turan's theorem
  41. Jendrol' Stanislav (University of Pavol Jozef Safarik in Košice, Slovakia)
    Parity vertex colourings of graphs (with P. Borowiecki, K. Budajová, and S. Krajčí)
  42. Jesse-Józefczyk Katarzyna (University of Zielona Góra, Poland)
    Global secure sets in cographs
  43. Junosza-Szaniawski Konstanty (Warsaw University of Technology, Poland)
    Counting independent sets in a claw-free 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)
  44. Kemnitz Arnfried (Technische Universitaet Braunschweig, Germany)
    d-Strong Edge Colorings of Graphs (with M. Marangio)
  45. Kędzior Anna (AGH University of Science and Technology, Poland)
    There are at least 660 universal one-sixths of K_17 (with Z. Skupień)
  46. Klešč Marián (University of Košice, Slovakia)
    On Cartesian products of cycles and their crossing numbers
  47. Knor Martin (Slovak University of Technology, Slovakia)
    Domination in a digraph and in its reverse (with L. Niepel)
  48. Kuziak Dorota (Gdańsk University of Technology, Poland)
    On the planarity and outerplanarity of iterated graphs (with M. Dettlaff)
  49. 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)
  50. Llano Bernardo (Metropolitan Autonomous University, Mexico)
    The dichromatic number and the acyclic disconnection in tournaments (with M. Olsen)
    2- and 3-existentially closed tournaments (with R. Zuazua)
  51. Löwenstein Christian (TU Ilmenau, Germany)
    The dichromatic number and the acyclic disconnection in tournaments (with M. A. Henning, D. Rautenbach)
  52. Madaras Tomáš (P.J. Šafárik University, Slovakia)
    On doubly light graphs (with P. Hudák, V. Kozáková)
  53. Małafiejska Anna (Gdańsk University of Technology , Poland)
    Interval incidence graph coloring (with R.. Janczewski, M. Małafiejski)
  54. Małafiejski Michał (Gdańsk University of Technology , Poland)
    Interval incidence graph coloring (with R.. Janczewski, A. Małafiejska)
  55. Manrique Martin (National Autonomous University of Mexico, Mexico)
    Level Hypergraphs (with H. Galeana-Sánchez)
  56. Marczyk Antoni (AGH University of Science and Technology, Poland)
  57. Meszka Mariusz (AGH University of Science and Technology, Poland)
  58. Michael Jerzy (University of Opole, Poland)
  59. Michalak Danuta (University of Zielona Góra, Poland)
  60. Mihok Peter (Technical University, Košice, Slovakia)
    Generalized circular colouring of graphs
  61. Naroski Paweł (Warsaw University of Technology, Poland)
    A Linear Time Algorithm for Finding Long Cycles in Strongly Connected 3-Uniform Hypergraphs (with Z. Lonc)
  62. Nikodem Mateusz (AGH University of Science and Technology, Poland)
    Conductors and the Frobenius vector in the Sylvester-Frobenius change problem (with Z. Skupień)
  63. Olejar Marian, Jr. (Slovak University of Technology in Bratislava, Slovakia)
    A note on star product of graphs and generalized voltage assignments
  64. Oravcová Janka (University of P. J. Šafárik, Slovakia)
    Tight sets versus tight vectors - distance graphs versus lonely runner (with R. Soták)
  65. Peterin Iztok (University of Maribor, Slovenia)
    Cartesian dimension of graphs
  66. Petrosyan Petros (Yerevan State University, Armenia)
    Interval edge colorings of some products of graphs
  67. Petrykowski Marcin (Wrocław University, Poland)
  68. Petryshyn Nataliya (Warsaw University of Technology, Poland)
  69. Pilśniak Monika (AGH University of Science and Technology, Poland)
    Coloring chip configurations on graphs and digraphs (with M. Borowiecki, J. Grytczuk)
  70. Prnaver Katja (University of Ljubljana, Slovenia)
  71. Pruchnewski Anja (TU Ilmenau, Germany)
    Random procedures for dominating sets in bipartite graphs (with S. Artmann)
  72. Puga Isabel ((National Autonomous University of Mexico, Mexico)
  73. 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)
  74. Roden-Bowie Miranda (University of North Alabama Florence, USA)
    On the Relations between Liars' Dominating and Set-sized Dominating Parameters (with P. J. Slater)
  75. Rożej Łukasz (Warsaw University of Technology, Poland)
    Game chromatic number of graphs with locally bounded number of cycles (with K. Junosza-Szaniawski)
  76. Rzążewski Paweł (Warsaw University of Technology, Poland)
  77. Schiermeyer Ingo (Technische Universität Bergakademie Freiberg, Germany)
    Rainbow connection in graphs with minimum degree three
  78. Schrötter Štefan (Technical University of Košice, Slovakia)
    On crossing numbers of join of paths and cycles with other graphs (with M. Klešč)
  79. Sewell J. Louis (University of Alabama in Huntsville, USA)
    Distance Independence in Graphs (with P. J. Slater)
  80. Sidorowicz Elżbieta (University of Zielona Góra, Poland)
  81. Singleton Joy (University of South Africa, South Africa)
    Independent sets meeting all longest paths (with S. van Aardt, M. Frick)
  82. Skupień Zdzisław (AGH University of Science and Technology, Poland)
    Structure of graphs with numerous dominating sets
  83. Slater Peter (University of Alabama in Huntsville, USA)
    Complementarity and Duality of Generalized Graphical Subset Parameters
  84. Soták Roman (University of P. J. Šafárik, Slovakia)
    Tight sets versus tight vectors - distance graphs versus lonely runner (with J. Oravcová)
  85. Staneková Ľubica (Slovak University of Technology Bratislava, Slovakia)
    Large vertex-transitive and Cayley digraphs with given degree and diameter (with Mária Ždímalová)
  86. Tesar Marek (Charles University, Prague, Czech Republic)
  87. Topp Jerzy (Gdansk University of Technology, Poland)
  88. Tuczyński Michał (Warsaw University of Technology, Poland)
    Counting maximal independent sets in graphs with maximum degree 3 (with K. Junosza-Szaniawski)
    Counting independent sets in a claw-free graph (with K. Junosza-Szaniawski)
  89. Vanherpe Jean-Marie (Laboratoire d'Informatique Fondamentale d'Orléans, France)
    On Fulkerson conjecture (with Jean-Luc Fouquet)
  90. Włoch Iwona (Rzeszow University of Technology, Poland)
    Generalized Pell numbers and their graph representations (with A. Włoch)
  91. Woźniak Mariusz (AGH University of Science and Technology, Poland)
  92. Yeh Roger (Feng Chia University, Taiwan)
    The edge span of graph distance labeling (with Ji-Wei Huang)
  93. Zapart Anna (Warsaw University of Technology, Poland)
    Fixed simplex property for retractable complexes (with A. Idzik)
  94. Zuazua Rita ((National Autonomous University of Mexico, Mexico)
    2- and 3-existentially closed tournaments (with B. Llano)
  95. Ż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)