Volume 16,
Number 1,
January 2007
- Pierre Charbit, Stéphan Thomassé, Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.
1-4
Electronic Edition (link) BibTeX
- Amin Coja-Oghlan, Andreas Goerdt, André Lanka:
Strong Refutation Heuristics for Random k-SAT.
5-28
Electronic Edition (link) BibTeX
- Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan:
Positive Influence and Negative Dependence.
29-41
Electronic Edition (link) BibTeX
- Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Ferromagnetic Ising with Local Fields.
43-61
Electronic Edition (link) BibTeX
- Kevin Hutson, Thomas M. Lewis:
The Expected Length of a Minimal Spanning Tree of a Cylinder Graph.
63-83
Electronic Edition (link) BibTeX
- Bill Jackson:
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs.
85-108
Electronic Edition (link) BibTeX
- Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte:
Rainbow Turán Problems.
109-126
Electronic Edition (link) BibTeX
- J. A. N. Remy, Alexander Souza, Angelika Steger:
On an Online Spanning Tree Problem in Randomly Weighted Graphs.
127-144
Electronic Edition (link) BibTeX
- C. R. Subramanian:
List Set Colouring: Bounds and Algorithms.
145-158
Electronic Edition (link) BibTeX
- Ádám Timár:
Cutsets in Infinite Graphs.
159-166
Electronic Edition (link) BibTeX
- Alexandr V. Kostochka, Gexin Yu:
Ore-type graph packing problems.
167-169
Electronic Edition (link) BibTeX
- Norman Biggs:
Topics in Algebraic Graph Theory, by Lowell W. Beineke and Robin J. Wilson (Academic Consultant: Peter J. Cameron), Encyclopedia of Mathematics and its Applications 102, CUP 2005, 257pp., GBP 50.00/$95.00.
171-172
Electronic Edition (link) BibTeX
Volume 16,
Number 2,
March 2007
- Noga Alon, Vera Asodi:
Edge Colouring with Delays.
173-191
Electronic Edition (link) BibTeX
- Joseph E. Bonin, Omer Giménez:
Multi-Path Matroids.
193-217
Electronic Edition (link) BibTeX
- Mei-Chu Chang:
Additive and Multiplicative Structure in Matrix Spaces.
219-238
Electronic Edition (link) BibTeX
- Bill Cuckler:
Hamiltonian Cycles in Regular Tournaments.
239-249
Electronic Edition (link) BibTeX
- G. E. Farr:
On the Ashkin-Teller Model and Tutte-Whitney Functions.
251-260
Electronic Edition (link) BibTeX
- Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
Adversarial Deletion in a Scale-Free Random Graph Process.
261-270
Electronic Edition (link) BibTeX
- Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár:
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.
271-275
Electronic Edition (link) BibTeX
- Daniela Kühn, Deryk Osthus:
Maximizing Several Cuts Simultaneously.
277-283
Electronic Edition (link) BibTeX
- William D. May, John C. Wierman:
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds.
285-307
Electronic Edition (link) BibTeX
- Lingsheng Shi, Nicholas C. Wormald:
Colouring Random 4-Regular Graphs.
309-344
Electronic Edition (link) BibTeX
Volume 16,
Number 3,
May 2007
- Brian H. Bowditch:
The Angel Game in the Plane.
345-362
Electronic Edition (link) BibTeX
- András Máthé:
The Angel of Power 2 Wins.
363-374
Electronic Edition (link) BibTeX
- Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky:
First-Order Definability of Trees and Sparse Random Graphs.
375-400
Electronic Edition (link) BibTeX
- Peter J. Cameron, Koko Kalambay Kayibi:
Orbital Chromatic and Flow Roots.
401-407
Electronic Edition (link) BibTeX
- Hemanshu Kaul, Alexandr V. Kostochka:
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer.
409-416
Electronic Edition (link) BibTeX
- R. Marchand, E. Zohoorian Azad:
Limit Law of the Length of the Standard Right Factor of a Lyndon Word.
417-434
Electronic Edition (link) BibTeX
- Martin Möhle:
On a Class of Non-Regenerative Sampling Distributions.
435-444
Electronic Edition (link) BibTeX
- Eran Ofek:
On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs.
445-457
Electronic Edition (link) BibTeX
- Lingsheng Shi, Nicholas C. Wormald:
Colouring Random Regular Graphs.
459-494
Electronic Edition (link) BibTeX
- Jeff Kahn, G. I. L. Kalai:
Thresholds and Expectation Thresholds.
495-502
Electronic Edition (link) BibTeX
Volume 16,
Number 4,
July 2007
- Luke Pebody:
Reconstructing Odd Necklaces.
503-514
Electronic Edition (link) BibTeX
- Amin Coja-Oghlan:
Colouring Semirandom Graphs.
515-552
Electronic Edition (link) BibTeX
- Harout K. Aydinian, Péter L. Erdös:
All Maximum Size Two-Part Sperner Systems: In Short.
553-555
Electronic Edition (link) BibTeX
- Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Sampling Regular Graphs and a Peer-to-Peer Network.
557-593
Electronic Edition (link) BibTeX
- Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Searching for a Black Hole in Synchronous Tree Networks.
595-619
Electronic Edition (link) BibTeX
- Svante Linusson, Johan Wästlund:
Completing a (k - 1)-Assignment.
621-629
Electronic Edition (link) BibTeX
- Svante Janson, Joel Spencer:
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.
631-658
Electronic Edition (link) BibTeX
- Richard Dudley:
The Generic Chaining: Upper and Lower Bounds of Stochastic Processes, by Michel Talagrand , Springer-Verlag, 2005.
659-660
Electronic Edition (link) BibTeX
Volume 16,
Number 5,
September 2007
Volume 16,
Number 6,
November 2007
Copyright © Sat May 16 23:54:26 2009
by Michael Ley (ley@uni-trier.de)
