Discrete Mathematics, Volume 276

Volume 276, Number 1-3, February 2004

• Jean-Luc Fouquet, Irena Rusu:
  Preface. 1-2
  
• Guest Editors. 3-
• Jørgen Bang-Jensen, Tibor Jordán:
  Splitting off edges between two subsets preserving the edge-connectivity of the graph. 5-28
  
• Halina Bielak:
  Local Ramsey numbers for copies of cycles. 29-42
  
• Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
  Orthogonal drawings based on the stratification of planar graphs. 43-57
  
• Endre Boros, Vladimir Gurvich, Roy Meshulam:
  Difference graphs. 59-64
  
• Roman Cada, Evelyne Flandrin, Hao Li, Zdenek Ryjácek:
  Cycles through given vertices and closures. 65-80
  
• Gilles Caporossi, Pierre Hansen:
  Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures. 81-94
  
• Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
  The minimum density of an identifying code in the king lattice. 95-109
  
• Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
  On i^--ER-critical graphs. 111-125
  
• Bruno Courcelle:
  Clique-width of countable graphs: a compactness property. 127-148
  
• Charles Delorme:
  Laplacian eigenvalues and fixed size multisection. 149-159
  
• Matt DeVos, Jaroslav Nesetril, André Raspaud:
  Antisymmetric flows and edge-connectivity. 161-167
  
• Vladimir Dobrynin:
  On the rank of a matrix associated with a graph. 169-175
  
• Hikoe Enomoto, Hao Li:
  Partition of a graph into cycles and degenerated cycles. 177-181
  
• Reinhardt Euler:
  Coloring planar Toeplitz graphs and the stable set polytope. 183-200
  
• Art S. Finbow, Bert Hartnell:
  Well-located graphs: a collection of well-covered ones. 201-209
  
• Sylvain Gravier, Frédéric Maffray:
  On the choice number of claw-free perfect graphs. 211-218
  
• Harald Gropp:
  "Réseaux réguliers" or regular graphs--Georges Brunel as a French pioneer in graph theory. 219-227
  
• Alain Guénoche, Bruno Leclerc, Vladimir Makarenkov:
  On the extension of a partial metric to a tree metric. 229-248
  
• Glen-Brug Guenver, Jean-Xavier Rampon:
  Split orders. 249-267
  
• Vladislav Kabanov, Igor Vakula:
  The lower domination parameters in inflation of graphs of radius 1. 269-272
  
• Sònia P. Mansilla, Oriol Serra:
  Automorphism groups of k-arc transitive covers. 273-285
  
• Jana Maxová, Jaroslav Nesetril:
  On covers of graphs. 287-294
  
• Arnaud Pêcher:
  Cayley partitionable graphs and near-factorizations of finite groups. 295-311
  
• Bert Randerath:
  3-Colorability and forbidden subgraphs. I: Characterizing pairs. 313-325
  
• Jeremy Spinrad:
  A note on computing graph closures. 327-329
  
• László A. Székely:
  A successful concept for measuring non-planarity of graphs: the crossing number. 331-352
  
• Zoltán Szigeti:
  On a min-max theorem on bipartite graphs. 353-361
  
• Jean-Marie Vanherpe:
  Clique-width of partner-limited graphs. 363-374
  
• A. Pawel Wojda:
  A condition for a graph to contain k-matching. 375-378
  
• Mariusz Wozniak:
  Packing of graphs and permutations--a survey. 379-391
  
• Heping Zhang, Fuji Zhang, Haiyuan Yao:
  Z-transformation graphs of perfect matchings of plane bipartite graphs. 393-404