Discrete Mathematics, Volume 121

Volume 121, Numbers 1-3, October 1993

• Preface. 1
  Electronic Edition (link) BibTeX
• Halina Bielak:
  Graphs with special neighbourhood orderings of vertices. 3-9
  Electronic Edition (link) BibTeX
• Mieczyslaw Borowiecki, Ewa Drgas-Burchardt:
  Classes of chromatically unique or equivalent graphs. 11-18
  Electronic Edition (link) BibTeX
• H. J. Broersma:
  A note on K₄-closures in hamiltonian graph theory. 19-23
  Electronic Edition (link) BibTeX
• H. J. Broersma, J. van den Heuvel, Henk Jan Veldman:
  Long cycles, degree sums and neighborhood unions. 25-35
  Electronic Edition (link) BibTeX
• Nathaniel Dean, Linda M. Lesniak, Akira Saito:
  Cycles of length 0 modulo 4 in graphs. 37-49
  Electronic Edition (link) BibTeX
• Odile Favaron:
  A note on the irredundance number after vertex deletion. 51-54
  Electronic Edition (link) BibTeX
• Odile Favaron, Pedro Mago, Oscar Ordaz:
  On the bipartite independence number of a balanced bipartite graph. 55-63
  Electronic Edition (link) BibTeX
• Miroslav Fiedler:
  Some minimax problems for graphs. 65-74
  Electronic Edition (link) BibTeX
• Jean-Luc Fouquet:
  A decomposition for a class of (P₅, P₅^_₅)-free graphs. 75-83
  Electronic Edition (link) BibTeX
• Jean-Luc Fouquet, A. Pawel Wojda:
  Mutual placement of bipartite graphs. 85-92
  Electronic Edition (link) BibTeX
• W. Frydrych:
  All nonhamiltonian tough graphs satisfying a 3-degree sum and fan-type conditions. 93-104
  Electronic Edition (link) BibTeX
• Rafal Kalinowski:
  Small periods of endomorphisms of trees. 105-111
  Electronic Edition (link) BibTeX
• Gyula O. H. Katona, Louis V. Quintas:
  The largest component in a random subgraph of the n-cycle. 113-116
  Electronic Edition (link) BibTeX
• Urzula Konieczna:
  Asymptotic normality of subcubes in random subgraphs of the n-cube. 117-122
  Electronic Edition (link) BibTeX
• Jean-Claude König, Dominique Sotteau:
  Symmetric routings of the hypercube. 123-134
  Electronic Edition (link) BibTeX
• Marek Kubale:
  Interval edge coloring of a graph with forbidden colors. 135-143
  Electronic Edition (link) BibTeX
• Maria Kwasnik:
  The primitivity of the strong product of two directed graphs. 145-150
  Electronic Edition (link) BibTeX
• Zbigniew Lonc:
  Majorization, packing, covering and matroids. 151-157
  Electronic Edition (link) BibTeX
• Zofia Majcher:
  Some special realizations of partition matrix sequences. 159-175
  Electronic Edition (link) BibTeX
• Roman Nedela:
  Covering spaces of locally homogeneous graphs. 177-188
  Electronic Edition (link) BibTeX
• Zdenek Ryjácek:
  N₂-locally disconnected graphs. 189-193
  Electronic Edition (link) BibTeX
• Günter Schaar:
  On 'maximal' Hamiltonian cycles in the square of a block. 195-198
  Electronic Edition (link) BibTeX
• Jerzy Topp:
  Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices. 199-210
  Electronic Edition (link) BibTeX
• Hoa Vu Dinh:
  On the length of longest dominating cycles in graphs. 211-222
  Electronic Edition (link) BibTeX
• Bing Wei:
  Hamiltonian paths and hamiltonian connectivity in graphs. 223-228
  Electronic Edition (link) BibTeX
• Mariusz Wozniak:
  A note on minimal order of a bipartite graph with exactly q quadrilaterals. 229-233
  Electronic Edition (link) BibTeX