dblp: Discrete Mathematics, Volume 75

Béla Bollobás: Paul Erdös at seventy-five. 3-5

Jin Akiyama, Fumi Nakada, Sinichi Tokunaga: Packing smaller graphs into a graph. 7-9

I. Algor, Noga Alon: The star arboricity of graphs. 11-22

Noga Alon, Béla Bollobás: Graphs with a small number of distinct induced subgraphs. 23-30

Jean-Claude Bermond, K. Berrada, Johny Bond: Extensions of networks with given diameter. 31-40

Norman Biggs: Confluence of some presentations associated with graphs. 41-46

Béla Bollobás, Graham Brightwell: Long cycles in graphs with no subgraphs of minimal degree 3. 47-53

Béla Bollobás, Steen Rasmussen: First cycles in random directed graph processes. 55-68

J. A. Bondy: Trigraphs. 69-79

Endre Boros, Peter L. Hammer: On clustering problems with connected optima in euclidean spaces. 81-88

Peter J. Cameron: Some sequences of integers. 89-102

Amanda G. Chetwynd, Anthony J. W. Hilton: 1-factorizing regular graphs of high degree - an improved bound. 103-112

Fan R. K. Chung, Paul D. Seymour: Graphs with small bandwidth and cutwidth. 113-119

Reinhard Diestel: Simplicial decompositions of graphs: a survey of applications. 121-144

Paul Erdös, András Hajnal: On the number of distinct induced subgraphs of a graph. 145-154

Paul Erdös, Jean-Louis Nicolas, András Sárközy: On the number of partitions of n without a given subsum (I). 155-166

Philippe Flajolet, Donald E. Knuth, Boris Pittel: The first cycles in an evolving graph. 167-215

Zoltán Füredi: Covering the complete graph by partitions. 217-226

H. Furstenberg, Y. Katznelson: A density version of the Hales-Jewett theorem for k=3. 227-241

Roland Häggkvist: On the path-complete bipartite Ramsey number. 243-245

Roland Häggkvist: Towards a solution of the dinitz problem? 247-251

Roland Häggkvist: A note on latin squares with restricted support. 253-254

Julie Haviland, Andrew Thomason: Pseudo-random hypergraphs. 255-278

Monique Laurent, Michel Deza: Bouquets of geometric lattices: some algebraic and topological aspects. 279-313

Imre Leader: A short proof of a theorem of vámos on matroid representations. 315-317

László Lovász, Michael E. Saks, William T. Trotter: An on-line graph coloring algorithm with sublinear performance ratio. 319-325

Jaroslav Nesetril, Vojtech Rödl: The partite construction and ramsey set systems. 327-334

Pierre Rosenstiehl: Scaffold permutations. 335-342

László A. Székely, Nicholas C. Wormald: Bounds on the measurable chromatic number of Rⁿ. 343-372

Andrew Thomason: A simple linear expected time algorithm for finding a hamilton path. 373-379

Andrew Thomason: Dense expanders and pseudo-random bipartite graphs. 381-386

Douglas R. Woodall: Forbidden graphs for degree and neighbourhood conditions. 387-404

Discrete Mathematics, Volume 75