Volume 20,
Number 1,
March 2004
Volume 20,
Number 2,
June 2004
- Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia:
A Problem on Hinged Dissections with Colours.
145-159
- Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj:
Configurations in 4-Cycle Systems.
161-179
- Weiting Cao, Michael J. Pelsmajer:
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1.
181-183
- Yubao Guo, Lutz Volkmann:
Extendable Cycles in Multipartite Tournaments.
185-190
- Mirko Hornák, Stefan Pcola, Mariusz Wozniak:
On the Achromatic Index of for a Prime q.
191-203
- Jesper Jansson, Takeshi Tokuyama:
Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition.
205-222
- Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A Note on Convex Decompositions of a Set of Points in the Plane.
223-231
- James G. Oxley, Haidong Wu:
The 3-Connected Graphs with Exactly Three Non-Essential Edges.
233-246
- Gelasio Salazar, Edgardo Ugalde:
An Improved Bound for the Crossing Number of C mC n: a Self-Contained Proof Using Mostly Combinatorial Arguments.
247-253
- Jozef Skokan, Lubos Thoma:
Bipartite Subgraphs and Quasi-Randomness.
255-262
- A. Volgenant, C. W. Duin:
On Steiner Versions of (bi)Connectivity in Network Problems.
263-273
- Xiao-Dong Zhang, Stanislaw Bylka:
Disjoint Triangles of a Cubic Line Graph.
275-280
- Igor E. Zverovich:
A Characterization of Domination Reducible Graphs.
281-289
Volume 20,
Number 3,
August 2004
- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Generalizing Pancyclic and k-Ordered Graphs.
291-309
- Yubin Gao, Yanling Shao:
The Number of Negative Entries in a Sign Pattern Allowing Orthogonality.
311-317
- Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald:
Random Hypergraph Processes with Degree Restrictions.
319-332
- Robert E. Jamison, Douglas B. West:
On Pattern Ramsey Numbers of Graphs.
333-339
- MingChu Li:
Hamiltonian Connected Claw-Free Graphs.
341-362
- Hirobumi Mizuno, Iwao Sato:
Some L-Function of a Regular Covering of a Graph.
363-375
- A. Muthusamy:
On Resolvable Multipartite G-Designs.
377-382
- Stavros D. Nikolopoulos, Charis Papadopoulos:
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.
383-397
- Bertran Steinsky:
Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs.
399-411
- Jichang Wu, Xueliang Li:
Removable Edges in Longest Cycles of 4-Connected Graphs.
413-422
- Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye:
The Chromaticity of Certain Complete Multipartite Graphs.
423-434
Volume 20,
Number 4,
November 2004
- Stephan Brandt, Mariusz Wozniak:
On Cyclic Packing of a Tree.
435-442
- Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger:
Colorability of Planar Graphs with Isolated Nontriangular Faces.
443-446
- Odile Favaron, Michael A. Henning:
Paired-Domination in Claw-Free Cubic Graphs.
447-456
- Anant P. Godbole, Joseph A. Johnson:
Even 2 × 2 Submatrices of a Random Zero-One Matrix.
457-466
- Wayne Goddard:
Minimum Degree Conditions for Cycles Including Specified Sets of Vertices.
467-483
- Akira Hiraki, Jack H. Koolen:
A Note on Regular Near Polygons.
485-497
- Garth Isaak:
Sum List Coloring Block Graphs.
499-506
- Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien:
Edge Decompositions of Multigraphs into 3-Matchings.
507-515
- Antoni Marczyk:
On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree.
517-529
- Gaetano Quattrocchi, Zsolt Tuza:
Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs.
531-540
- C. A. Rodger:
Hamilton Decomposable Graphs with Specified Leaves.
541-543
- Ian M. Wanless:
Cycle Switches in Latin Squares.
545-570
- Igor E. Zverovich:
A Solution to a Problem of Jacobson, Kézdy and Lehel.
571-577
Copyright © Fri Dec 4 03:11:22 2009
by Michael Ley (ley@uni-trier.de)
