Journals in DBLP
Béla Bollobás Paul Erdös at seventy-five. [Citation Graph (0, 0)][DBLP ] Journal ] Jin Akiyama , Fumi Nakada , Sinichi Tokunaga Packing smaller graphs into a graph. [Citation Graph (0, 0)][DBLP ] Journal ] I. Algor , Noga Alon The star arboricity of graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Noga Alon , Béla Bollobás Graphs with a small number of distinct induced subgraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Jean-Claude Bermond , K. Berrada , Johny Bond Extensions of networks with given diameter. [Citation Graph (0, 0)][DBLP ] Journal ] Norman Biggs Confluence of some presentations associated with graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Béla Bollobás , Graham Brightwell Long cycles in graphs with no subgraphs of minimal degree 3. [Citation Graph (0, 0)][DBLP ] Journal ] Béla Bollobás , Steen Rasmussen First cycles in random directed graph processes. [Citation Graph (0, 0)][DBLP ] Journal ] J. A. Bondy Trigraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Endre Boros , Peter L. Hammer On clustering problems with connected optima in euclidean spaces. [Citation Graph (0, 0)][DBLP ] Journal ] Peter J. Cameron Some sequences of integers. [Citation Graph (0, 0)][DBLP ] Journal ] Amanda G. Chetwynd , Anthony J. W. Hilton 1-factorizing regular graphs of high degree - an improved bound. [Citation Graph (0, 0)][DBLP ] Journal ] Fan R. K. Chung , Paul D. Seymour Graphs with small bandwidth and cutwidth. [Citation Graph (0, 0)][DBLP ] Journal ] Reinhard Diestel Simplicial decompositions of graphs: a survey of applications. [Citation Graph (0, 0)][DBLP ] Journal ] Paul Erdös , András Hajnal On the number of distinct induced subgraphs of a graph. [Citation Graph (0, 0)][DBLP ] Journal ] Paul Erdös , J. L. Nicolas , András Sárközy On the number of partitions of n without a given subsum (I). [Citation Graph (0, 0)][DBLP ] Journal ] Philippe Flajolet , Donald E. Knuth , Boris Pittel The first cycles in an evolving graph. [Citation Graph (0, 0)][DBLP ] Journal ] Zoltán Füredi Covering the complete graph by partitions. [Citation Graph (0, 0)][DBLP ] Journal ] H. Furstenberg , Y. Katznelson A density version of the Hales-Jewett theorem for k=3. [Citation Graph (0, 0)][DBLP ] Journal ] Roland Häggkvist On the path-complete bipartite Ramsey number. [Citation Graph (0, 0)][DBLP ] Journal ] Roland Häggkvist Towards a solution of the dinitz problem? [Citation Graph (0, 0)][DBLP ] Journal ] Roland Häggkvist A note on latin squares with restricted support. [Citation Graph (0, 0)][DBLP ] Journal ] Julie Haviland , Andrew Thomason Pseudo-random hypergraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Monique Laurent , Michel Deza Bouquets of geometric lattices: some algebraic and topological aspects. [Citation Graph (0, 0)][DBLP ] Journal ] Imre Leader A short proof of a theorem of vámos on matroid representations. [Citation Graph (0, 0)][DBLP ] Journal ] László Lovász , Michael E. Saks , William T. Trotter An on-line graph coloring algorithm with sublinear performance ratio. [Citation Graph (0, 0)][DBLP ] Journal ] Jaroslav Nesetril , Vojtech Rödl The partite construction and ramsey set systems. [Citation Graph (0, 0)][DBLP ] Journal ] Pierre Rosenstiehl Scaffold permutations. [Citation Graph (0, 0)][DBLP ] Journal ] László A. Székely , Nicholas C. Wormald Bounds on the measurable chromatic number of Rn . [Citation Graph (0, 0)][DBLP ] Journal ] Andrew Thomason A simple linear expected time algorithm for finding a hamilton path. [Citation Graph (0, 0)][DBLP ] Journal ] Andrew Thomason Dense expanders and pseudo-random bipartite graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Douglas R. Woodall Forbidden graphs for degree and neighbourhood conditions. [Citation Graph (0, 0)][DBLP ] Journal ] 