Electronic Notes in Discrete Mathematics, Volume 24

Volume 24, July 2006

• Mariusz Meszka:
  Preface. 1
  
• Lech Adamus:
  Long cycles in graphs and digraphs. 3-7
  
• F. Affif Chaouche, Abdelhafid Berrachedi:
  Automorphisms group of generalized Hamming Graphs. 9-15
  
• F. Aguiló-Gost, Alicia Miralles, Marisa Zaragozá:
  Using Double-Loop digraphs for solving Frobenius' Problems. 17-24
  
• Kiyoshi Ando:
  Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. 25-30
  
• V. I. Benediktovich:
  Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph. 31-38
  
• Halina Bielak:
  Size Ramsey numbers for some regular graphs. 39-45
  
• Simona Bonvicini, Giuseppe Mazzuoccolo:
  On perfectly one-factorable cubic graphs. 47-51
  
• Sylwia Cichacz, Agnieszka Görlich:
  Decomposition of complete bipartite graphs into open trails. 53-55
  
• Ewa Drgas-Burchardt:
  On k-chromatically unique and k-chromatically equivalent hypergraphs. 57-60
  
• Evelyne Flandrin, Hao Li, Roman Cada:
  Hamiltonicity and pancyclicity of generalized prisms. 61-67
  
• Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
  The structure and unlabelled enumeration of toroidal graphs with no K_{3, 3}'s. 69-76
  
• Izolda Gorgol, Ewa Lazuka:
  Rainbow numbers for certain graphs. 77-79
  
• Harald Gropp:
  Hamiltonian graphs from Kirkman to König. 81-88
  
• Doost Ali Mojdeh, Nader Jafari Rad:
  On the total domination critical graphs. 89-92
  
• Mark Korenblit, Vadim E. Levit:
  Nested Graphs. 93-99
  
• Roman Kuzel:
  The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs. 101-104
  
• Ewa Drgas-Burchardt, Ewa Lazuka:
  On chromatic polynomials of hypergraphs. 105-110
  
• V. V. Lepin:
  A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree. 111-116
  
• Wojciech Kordecki, Anna Lyczkowska-Hanckowiak:
  Expected value of the minimal basis of random matroid and distributions of q-analogs of order statistics. 117-123
  
• Edita Mácajová, Martin Skoviera:
  Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. 125-132
  
• Giuseppe Mazzuoccolo:
  On 2-factorizations with some symmetry. 133-135
  
• Adam Meissner, Magdalena Niwinska, Krzysztof Zwierzynski:
  Computing an irregularity strength of selected graphs. 137-144
  
• Méziane Aïder, Sylvain Gravier, Kahina Meslem:
  Isometric embedding of subdivided Connected graphs in the hypercube. 145-151
  
• Guillermo Pineda-Villavicencio, José Gómez, Mirka Miller, Hebert Pérez-Rosés:
  New Largest Graphs of Diameter 6: (Extended Abstract). 153-160
  
• Jakub Teska, Roman Kuzel, Mirka Miller:
  Divisibility conditions in almost Moore digraphs with selfrepeats. 161-163
  
• Matt DeVos, Bojan Mohar:
  Small separations in vertex-transitive graphs. 165-172
  
• Takuro Fukunaga, Hiroshi Nagamochi:
  Some Theorems on Detachments Preserving Local-Edge-Connectivity. 173-180
  
• Daria Olszewska:
  On the first unknown value of the function g(v). 181-185
  
• Dieter Rautenbach:
  A Conjecture of Borodin and a Coloring of Grünbaum. 187-194
  
• Gloria Rinaldi:
  One-factorizations of complete graphs with regular automorphism groups. 195-198
  
• Anna Rycerz:
  A discrete structure with the minimal set. 199-202
  
• M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
  Some structural, metric and convex properties on the boundary of a graph. 203-209
  
• Elzbieta Sidorowicz:
  Marking Games. 211-214
  
• Miroslav Chladný, Martin Skoviera:
  Decompositions of Snarks into Repeated Dot-Products. 215-222
  
• Yury L. Orlovich, P. V. Skums:
  Squares of Intersection Graphs and Induced Matchings. 223-230
  
• Zdzislaw Skupien:
  On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. 231-235
  
• Malgorzata Kuchta, Jolanta Stasiak:
  Maximal Binary Cliques. 237-241
  
• Anna Beata Kwiatkowska, Maciej M. Syslo:
  On Page Number of N-free Posets. 243-249
  
• Y. V. Krylou, A. J. Perez Tchernov:
  On the problem of domino recognition. 251-258
  
• Tiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto:
  Antibandwidth of Complete k-Ary Trees. 259-266
  
• Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
  On double bound graphs and forbidden subposets. 267-271
  
• Csilla Bujtás, Zsolt Tuza:
  Mixed colorings of hypergraphs. 273-275
  
• Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
  On isomorphic linear partitions in cubic graphs. 277-284
  
• Beata Orchel, A. Pawel Wojda:
  Some results on placing bipartite graphs of maximum degree two. 285-289
  
• Artur Szymanski, A. Pawel Wojda:
  Self-complementary hypergraphs and their self-complementing permutations. 291-294
  
• Mirko Hornák, Mariusz Wozniak:
  On neighbour-distinguishing colourings from lists. 295-297
  
• Manouchehr Zaker:
  Greedy defining sets in graphs and Latin squares. 299-302