Table of Contents
General
| Random graphs with bounded maximum degree: asymptotic structure and a logical limit law | PDF PostScript |
| Vera Koponen | 229-254 |
Analysis of Algorithms
| The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis | PDF PostScript |
| Helmut Prodinger, Guy Louchard | 91-128 |
| The Analysis of Find and Versions of it | PDF PostScript |
| Diether Knof, Uwe Roesler | 129-154 |
Automata, Logic and Semantics
| Digraph Complexity Measures and Applications in Formal Language Theory | PDF PostScript |
| Hermann Gruber | 189-204 |
Combinatorics
| Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs | PDF PostScript |
| Robert H. Sloan, Despina Stasi, György Turán | 29-36 |
Discrete Algorithms
| On Quadratic Threshold CSPs | PDF PostScript |
| Per Austrin, Siavosh Benabbas, Avner Magen | 205-228 |
Distributed Computing and Networking
| On the algebraic numbers computable by some generalized Ehrenfest urns | PDF PostScript |
| Marie Albenque, Lucas Gerin | 271-284 |
Graph Theory
| The competition number of a generalized line graph is at most two | PDF PostScript |
| Boram Park, Yoshio Sano | 1-10 |
| On bipartite powers of bigraphs | PDF PostScript |
| Yoshio Okamoto, Yota Otachi, Ryuhei Uehara | 11-20 |
| On paths, trails and closed trails in edge-colored graphs | PDF PostScript |
| Laurent Gourvès, Adria Ramos de Lyra, Carlos Alberto Martinhon, Jérôme Monnot | 57-74 |
| Graphs with many Vertex-Disjoint Cycles | PDF PostScript |
| Dieter Rautenbach, Friedrich Regen | 75-82 |
| Random Cayley digraphs of diameter 2 and given degree | PDF PostScript |
| Manuel E Lladser, Primoz Potocnik, Jozef Širáň, Mark C Wilson | 83-90 |
| Immersion Containment and Connectivity in Color-Critical Graphs | PDF PostScript |
| Faisal N. Abu-Khzam, Michael A. Langston | 155-164 |
| Acyclic Chromatic Index of Fully Subdivided Graphs and Halin Graphs | PDF PostScript |
| Manu Basavaraju | 165-172 |
| On 4-valent Frobenius circulant graphs | PDF PostScript |
| Sanming Zhou | 173-188 |
| A Note on Planar Ramsey Numbers for a Triangle Versus Wheels | PDF PostScript |
| Guofei Zhou, Yaojun Chen, Zhengke Miao, Shariefuddin Pirzada | 255-260 |
| Secure Frameproof Code Through Biclique Cover | PDF PostScript |
| Hossein Hajiabolhassan, Farokhlagha Moazami | 261-270 |
| Upper k-tuple domination in graphs | PDF PostScript |
| Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao | 285-292 |
Graphs and Algorithms
| On neighbour-distinguishing colourings from lists | PDF PostScript |
| Mirko Hornak, Mariusz Wozniak | 21-28 |
| Some Results on Stable Sets for k-Colorable P6-Free Graphs and Generalizations | PDF PostScript |
| Raffaele Mosca | 37-56 |
ISSN: 1365-8050