Discrete Mathematics, Volume 206

Volume 206, Numbers 1-3, August 1999

• B. Devadas Acharya, Purnima Gupta:
  Domination in graphoidal covers of a graph. 3-33
  Electronic Edition (link) BibTeX
• Robert E. L. Aldred, Derek A. Holton, M. I. Porteous, Michael D. Plummer:
  Two results on matching extensions with prescribed and proscribed edge sets. 35-43
  Electronic Edition (link) BibTeX
• S. Arumugam, J. Paulraj Joseph:
  On graphs with equal domination and connected domination numbers. 45-49
  Electronic Edition (link) BibTeX
• Jay S. Bagga, Lowell W. Beineke, Badri N. Varma:
  The super line graph L₂. 51-61
  Electronic Edition (link) BibTeX
• Lowell W. Beineke, Izak Broere, Michael A. Henning:
  Queens graphs. 63-75
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena:
  On the maximum average degree and the oriented chromatic number of a graph. 77-89
  Electronic Edition (link) BibTeX
• Manoj Changat, Joseph Mathew:
  On triangle path convexity in graphs. 91-95
  Electronic Edition (link) BibTeX
• Sheshayya A. Choudum, K. Kayathri:
  An extension of Vizing's adjacency lemma on edge chromatic critical graphs. 97-103
  Electronic Edition (link) BibTeX
• Sheshayya A. Choudum, S. Pitchai Muthu Kishore:
  Graceful labelling of the union of paths and cycles. 105-117
  Electronic Edition (link) BibTeX
• Sheshayya A. Choudum, B. Ponnusamy:
  Ramsey numbers for transitive tournaments. 119-129
  Electronic Edition (link) BibTeX
• Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li, Zhenhong Liu:
  On 2-factors in claw-free graphs. 131-137
  Electronic Edition (link) BibTeX
• Odile Favaron, Evelyne Flandrin, Hao Li, Feng Tian:
  An Ore-type condition for pancyclability. 139-144
  Electronic Edition (link) BibTeX
• Sébastien Ferenczi:
  Complexity of sequences and dynamical systems. 145-154
  Electronic Edition (link) BibTeX
• David G. Glynn:
  The representation of any affine plane of prime-power order within its own line-code. 155-158
  Electronic Edition (link) BibTeX
• Peter J. Owens:
  Shortness parameters for polyhedral graphs. 159-169
  Electronic Edition (link) BibTeX
• K. R. Parthasarathy:
  Graph characterising polynomials. 171-178
  Electronic Edition (link) BibTeX
• K. S. Parvathy, A. Vijayakumar:
  Convex extendable trees. 179-185
  Electronic Edition (link) BibTeX
• Erich Prisner:
  Generalized octahedra and cliques in intersection graphs of uniform hypergraphs. 187-195
  Electronic Edition (link) BibTeX
• G. Ravindra:
  Some classes of strongly perfect graphs. 197-203
  Electronic Edition (link) BibTeX
• N. Sridharan, G. Ramachandran:
  Simple graphs containing induced subgraphs whose automorphism groups are isomorphic to subgroups of a given finite group. 205-212
  Electronic Edition (link) BibTeX
• N. Usha Devi, G. R. Vijayakumar:
  Hereditary properties of graphs. 213-215
  Electronic Edition (link) BibTeX
• V. Vijayalakshmi:
  Multiplicity of triangles in cocktail party graphs. 217-218
  Electronic Edition (link) BibTeX