Discrete Applied Mathematics, Volume 141

Volume 141, Numbers 1-3, 30 May 2004

• Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter:
  Preface. 1
  Electronic Edition (link) BibTeX
• Liliana Alcón, Marisa Gutierrez:
  Cliques and extended triangles. A necessary condition for planar clique graphs. 3-17
  Electronic Edition (link) BibTeX
• Stéphan Ceroi, Frédéric Havet:
  Trees with three leaves are (n+1)-unavoidable. 19-39
  Electronic Edition (link) BibTeX
• Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
  Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. 41-91
  Electronic Edition (link) BibTeX
• Simone Dantas, Sylvain Gravier, Frédéric Maffray:
  Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. 93-101
  Electronic Edition (link) BibTeX
• Luc Devroye, Carlos Zamora-Cura:
  Expected worst-case partial match in random quadtries. 103-117
  Electronic Edition (link) BibTeX
• Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
  On the complexity of the approximation of nonplanarity parameters for cubic graphs. 119-134
  Electronic Edition (link) BibTeX
• Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport:
  AT-free graphs: linear bounds for the oriented diameter. 135-148
  Electronic Edition (link) BibTeX
• Zhicheng Gao, Jianyu Wang:
  Exact enumeration of rooted 3-connected triangular maps on the projective plane. 149-159
  Electronic Edition (link) BibTeX
• Ryan B. Hayward, William J. Lenhart:
  Bichromatic P₄-composition schemes for perfect orderability. 161-183
  Electronic Edition (link) BibTeX
• Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
  Partitioning chordal graphs into independent sets and cliques. 185-194
  Electronic Edition (link) BibTeX
• Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
  Clique divergent clockwork graphs and partial orders. 195-207
  Electronic Edition (link) BibTeX
• Lauro Lins, Sóstenes Lins, Silvio Melo:
  Phorma: perfectly hashable order restricted multidimensional arrays. 209-223
  Electronic Edition (link) BibTeX
• Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi:
  An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. 225-241
  Electronic Edition (link) BibTeX
• Lucia Draque Penso, Valmir C. Barbosa:
  A distributed algorithm to find k-dominating sets. 243-253
  Electronic Edition (link) BibTeX
• Miguel A. Pizaña:
  Distances and diameters on iterated clique graphs. 255-261
  Electronic Edition (link) BibTeX
• Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa:
  Bounds for optimal coverings. 263-276
  Electronic Edition (link) BibTeX
• Abilio Lucena, Mauricio G. C. Resende:
  Strong lower bounds for the prize collecting Steiner problem in graphs. 277-294
  Electronic Edition (link) BibTeX