Electronic Notes in Discrete Mathematics, Volume 5

Volume 5, July 2000

• Irena Rusu:
  Preface: Volume 5. 1-2
  Electronic Edition (link) BibTeX
• Méziane Aïder, Sylvain Gravier:
  Critical graphs for clique-coloring. 3-6
  Electronic Edition (link) BibTeX
• Kiyoshi Ando:
  Contractible edges in a k-connected graph (K₁ + P₄)-free graph. 7-10
  Electronic Edition (link) BibTeX
• Krystyna T. Balinska, Louis V. Quintas:
  Results and Problems Concerning Edge Transformed Graphs. 11-14
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen:
  Problems concerning global connectivity of directed graphs. 15-18
  Electronic Edition (link) BibTeX
• F. Bendali, Ali Ridha Mahjoub, J. Mailfert:
  Composition of graphs and the triangle free subgraph polytope. 19-22
  Electronic Edition (link) BibTeX
• Halina Bielak:
  Local Ramsey Numbers for Copies of Cycles. 23-26
  Electronic Edition (link) BibTeX
• Hans L. Bodlaender:
  The algorithmic theory of treewidth. 27-30
  Electronic Edition (link) BibTeX
• Anthony Bonato, Kathie Cameron:
  On 2-e.c. graphs, tournaments, and hypergraphs. 31-34
  Electronic Edition (link) BibTeX
• Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
  Orthogonal Drawings Based On The Stratification Of Planar Graphs. 35-37
  Electronic Edition (link) BibTeX
• Gabriela Hauser Bordalo, B. Monjardet:
  The lattice of strict completions of a poset. 38-41
  Electronic Edition (link) BibTeX
• Bostjan Bresar:
  On subgraphs of Cartesian product graphs and S-primeness. 42-45
  Electronic Edition (link) BibTeX
• Richard C. Brewster, Pavol Hell:
  On homomorphisms to edge-coloured cycles. 46-49
  Electronic Edition (link) BibTeX
• Kathie Cameron:
  Induced Matchings in Intersection Graphs. 50-52
  Electronic Edition (link) BibTeX
• Roberto Canogar:
  Partition Designs with two subsets of the Hamming Space. 53-55
  Electronic Edition (link) BibTeX
• Nathalie Caspard, Claude Le Conte de Poly-Barbut, Roberto Mantaci, Michel Morvan:
  Cayley lattices of finite Coxeter groups are bounded. 56-59
  Electronic Edition (link) BibTeX
• Irène Charon, Olivier Hudry:
  Slater orders and Hamiltonian paths of tournaments. 60-63
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
  On i-minus-Edge-Removal-critical graphs. 64-66
  Electronic Edition (link) BibTeX
• Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
  A hypergraph approach to digital fingerprinting. 67-70
  Electronic Edition (link) BibTeX
• Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
  On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). 71-74
  Electronic Edition (link) BibTeX
• Bruno Courcelle:
  Clique-width of countable graphs: a compactness property. 75-76
  Electronic Edition (link) BibTeX
• Henry Crapo, Claude Le Conte de Poly-Barbut:
  Coxeter groups through the looking glass: Mirrors and Convexity. 77-80
  Electronic Edition (link) BibTeX
• Rita Csákány:
  Some Results on the Sandglass Conjecture. 81-84
  Electronic Edition (link) BibTeX
• Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
  Some results on graph parameters in weighted graphs. 85-88
  Electronic Edition (link) BibTeX
• Celina M. Herrera de Figueiredo, Sulamita Klein, Kristina Vuskovic:
  The graph sandwich problem for 1-join composition is NP-complete. 89-92
  Electronic Edition (link) BibTeX
• Charles Delorme:
  Laplacian Eigenvalues and multisections. 93-96
  Electronic Edition (link) BibTeX
• Dominique de Werra:
  Variations on the theorem of Birkhoff-von Neumann and extensions. 97-99
  Electronic Edition (link) BibTeX
• Vladimir Dobrynin:
  On rank of a matrix associated with graph. 100-103
  Electronic Edition (link) BibTeX
• Damanpal Singh Dogra, Dominique Fortin:
  Simultaneous Disjoint Routing in Regular Graphs. 104-107
  Electronic Edition (link) BibTeX
• Reinhardt Euler:
  Coloring Planar Toeplitz Graphs. 108-111
  Electronic Edition (link) BibTeX
• Guillaume Fertin, André Raspaud:
  Recognizing Recursive Circulant Graphs (Extended Abstract). 112-115
  Electronic Edition (link) BibTeX
• Gasper Fijavz:
  K₆ and icosahedron minors in 5-connected projective planar graphs. 116-119
  Electronic Edition (link) BibTeX
• Art S. Finbow, Bert Hartnell:
  Well-located graphs: A collection of well-covered ones. 120-122
  Electronic Edition (link) BibTeX
• Miranca Fischermann, Lutz Volkmann:
  Graphs with unique dominating sets. 123-125
  Electronic Edition (link) BibTeX
• András Frank:
  Edge-Connectivities of Graphs and Digraphs. 126-129
  Electronic Edition (link) BibTeX
• Peter Frankl, Gyula Y. Katona:
  Extremal k-edge-hamiltonian Hypergraphs. 130-133
  Electronic Edition (link) BibTeX
• Cyril Gavoille, Christophe Paul:
  Approximate Distance Labeling Schemes. 134-137
  Electronic Edition (link) BibTeX
• Vassilis Giakoumakis, Jean-Marie Vanherpe:
  Linear time recognition of Weak bisplit graphs. 138-141
  Electronic Edition (link) BibTeX
• Izolda Gorgol:
  Some medications of Ramsey numbers. 142-144
  Electronic Edition (link) BibTeX
• Harald Gropp:
  "Réseaux réguliers" or regular graphs. 145-148
  Electronic Edition (link) BibTeX
• Bertrand Guenin:
  A Characterization of Weakly Bipartite Graphs. 149-151
  Electronic Edition (link) BibTeX
• Alain Guénoche, Bruno Leclerc, Vladimir Makarenkov:
  Generalized trees related with tree metrics. 152-154
  Electronic Edition (link) BibTeX
• Glen-Brug Guenver, Jean-Xavier Rampon:
  Split Orders. 155-157
  Electronic Edition (link) BibTeX
• Pierre Hansen, Gilles Caporossi:
  AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory. 158-161
  Electronic Edition (link) BibTeX
• Christophe Haro, Patrick Martineau, Christian Proust:
  Digraph representation by its path matrix The particular case of the bipartite graphs. 162-165
  Electronic Edition (link) BibTeX
• Frédéric Havet:
  Trees in tournaments. 166-169
  Electronic Edition (link) BibTeX
• Pavol Hell:
  Graph Packings. 170-173
  Electronic Edition (link) BibTeX
• Francine Herrmann, Alain Hertz:
  Finding the chromatic number by means of critical graphs. 174-176
  Electronic Edition (link) BibTeX
• Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes:
  Rotational Cayley Graphs on Transposition Generated Groups. 177-180
  Electronic Edition (link) BibTeX
• Arne Hoffmann:
  Regular factors in regular multipartite graphs. 181-184
  Electronic Edition (link) BibTeX
• Bill Jackson, Tibor Jordán:
  Connectivity Augmentation of Graphs. 185-188
  Electronic Edition (link) BibTeX
• Stanislav Jendrol, Heinz-Jürgen Voss:
  Light subgraphs of multigraphs embedded in compact 2-manifolds. 189-192
  Electronic Edition (link) BibTeX
• Petra Johann:
  On the structure of graphs with a unique k-factor. 193-195
  Electronic Edition (link) BibTeX
• Vladislav Kabanov, Igor Vakula:
  The lower domination parameters in inflated graphs. 196-197
  Electronic Edition (link) BibTeX
• Atsushi Kaneko, Kiyoshi Yoshimoto:
  A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. 198-200
  Electronic Edition (link) BibTeX
• Ken-ichi Kawarabayashi:
  Relative Length of Longest Path and Longest Cycle. 201
  Electronic Edition (link) BibTeX
• Hamamache Kheddouci:
  Partially Square Graphs, Hamiltonicity and Circumference II. 202-205
  Electronic Edition (link) BibTeX
• Felix Lazebnik, Andrew J. Woldar:
  General Properties of Some Graphs Defined by Systems of Equations. 206-209
  Electronic Edition (link) BibTeX
• Ali Ridha Mahjoub, Pierre Pesneau:
  On Steiner 2-edge connected polytopes. 210-213
  Electronic Edition (link) BibTeX
• Federico Malucelli, Sara Nicoloso:
  Shiftable Intervals. 214-217
  Electronic Edition (link) BibTeX
• Antoni Marczyk:
  On pancyclism of hamiltonian graphs. 218-221
  Electronic Edition (link) BibTeX
• Jana Maxová, Jaroslav Nesetril:
  On covers of graphs. 222-224
  Electronic Edition (link) BibTeX
• Sean McGuinness:
  Contractible bonds in Graphs. 225-227
  Electronic Edition (link) BibTeX
• Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald:
  The asymptotic number of graphs with a restriction on the maximum degree. 228-230
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  Some Topological Methods in Graph Coloring Theory. 231-234
  Electronic Edition (link) BibTeX
• Michael Molloy, Bruce A. Reed:
  k-Colouring when k is close to Delta. 235-238
  Electronic Edition (link) BibTeX
• Juan José Montellano-Ballesteros, Victor Neumann-Lara:
  Totally Multicoloured Cycles. 239-242
  Electronic Edition (link) BibTeX
• Wendy J. Myrvold, Jianping Roth:
  Simpler Projective Plane Embedding. 243-246
  Electronic Edition (link) BibTeX
• Michael Naatz:
  A Connectivity Lemma. 247-250
  Electronic Edition (link) BibTeX
• Viet Hung Nguyen, Jean François Maurras:
  A procedure of facet composition for the symmetric Traveling Salesman Polytope. 251-252
  Electronic Edition (link) BibTeX
• Patrice Ossona de Mendez, Pierre Rosenstiehl:
  Coding Properties of Breadth-First Search Orderings. 253-255
  Electronic Edition (link) BibTeX
• A. Pâcher:
  Cayley partitionable graphs. 256-259
  Electronic Edition (link) BibTeX
• Oleg Pikhurko:
  Size Ramsey Numbers Involving Large Stars. 260-262
  Electronic Edition (link) BibTeX
• Norbert Radics:
  Rigidity of multi-story buildings. 263-265
  Electronic Edition (link) BibTeX
• Vijay Raghavan, Jeremy Spinrad:
  Solving Problems on Special Classes of Graphs. 266-269
  Electronic Edition (link) BibTeX
• Bert Randerath:
  3-Colourability and Forbidden Subgraphs. 270-273
  Electronic Edition (link) BibTeX
• András Recski:
  VLSI Routing in Polynomial Time. 274-277
  Electronic Edition (link) BibTeX
• Gábor Simonyi:
  Perfection, Imperfection, and Graph Entropy. 278-280
  Electronic Edition (link) BibTeX
• Petra Smolikovaa:
  The Simple Chromatic Number of Oriented Graphs. 281-283
  Electronic Edition (link) BibTeX
• László A. Székely:
  A successful concept for measuring non-planarity of graphs: the crossing number. 284-287
  Electronic Edition (link) BibTeX
• Dávid Szeszlér:
  Hamilton Cycles and Degree Sequences. 288-290
  Electronic Edition (link) BibTeX
• Zoltán Szigeti:
  On min-max theorems in matching theory. 291-294
  Electronic Edition (link) BibTeX
• Andrew Thomason:
  Subdivisions, linking, minors, and extremal functions. 295-298
  Electronic Edition (link) BibTeX
• Morimasa Tsuchiya, Kenjiro Ogawa, Shin-ichi Iwai:
  On construction of bound graphs. 299-302
  Electronic Edition (link) BibTeX
• Jean-Marie Vanherpe:
  Clique width of Partner limited graphs. 303-306
  Electronic Edition (link) BibTeX
• A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
  On self-complementary supergraphs of (n, n)-graphs. 307-310
  Electronic Edition (link) BibTeX
• Mariusz Wozniak:
  Packing of graphs and permutations. 311-314
  Electronic Edition (link) BibTeX
• Kiyoshi Yoshimoto:
  Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. 315-316
  Electronic Edition (link) BibTeX
• Heping Zhang, Fuji Zhang:
  Total Z-transformation graphs of perfect matching of plane bipartite graphs. 317-320
  Electronic Edition (link) BibTeX
• Sònia P. Mansilla, Oriol Serra:
  Exactly k-arc Transitive Covers. 321
  Electronic Edition (link) BibTeX