Discrete Mathematics
Journal
-
- Overview
-
- Identity
-
- View All
-
Overview
publication venue for
-
Extra two-fold Steiner pentagon systems
2012
-
Perfect dexagon triple systems
2008
-
Extended Petersen graphs
2005
-
Maximal arcs in Steiner systems S(2,4,v)
2003
-
Counting tableaux with row and column bounds
1995
-
Improved upper bounds on even-cycle creating Hamilton paths.
347:114107-114107.
2024
-
An efficient shift rule for the prefer-max De Bruijn sequence.
342:226-232.
2019
-
Shedding vertices of vertex decomposable well-covered graphs.
341:3355-3369.
2018
-
Decompositions of complete graphs into circulants.
339:2471-2480.
2016
-
On a problem of Mariusz Meszka.
338:139-143.
2015
-
Triple metamorphosis of twofold triple systems.
313:1872-1883.
2013
-
A conjecture on critical graphs and connections to the persistence of associated primes.
310:2176-2182.
2010
-
Steiner almost self-complementary graphs and halving near-Steiner triple systems.
309:5650-5654.
2009
-
The effect of redundancy on probability bounds.
309:123-127.
2009
-
The chromatic number of 5-valent circulants.
308:6269-6284.
2008
-
Clique partitions of distance multigraphs.
308:3230-3240.
2008
-
Preface.
308:153-153.
2008
-
Un des “problèmes plaisans et délectables” de Claude Berge.
306:2299-2302.
2006
-
Improving probability bounds by optimization over subsets.
306:526-530.
2006
-
Preface.
299:1-1.
2005
-
Addressing the Petersen graph.
286:241-244.
2004
-
The Hamilton–Waterloo problem: the case of Hamilton cycles and triangle-factors.
284:181-188.
2004
-
Bicolouring Steiner systems S(2,4,v).
283:249-253.
2004
-
The largest non-integer real zero of chromatic polynomials of graphs with fixed order.
282:103-112.
2004
-
The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles.
278:175-193.
2004
-
Embedding Steiner triple systems into Steiner systems S(2,4,v).
274:199-212.
2004
-
Completing the spectrum of 2-chromatic S(2,4,v).
247:225-228.
2002
-
Colouring Steiner systems with specified block colour patterns.
240:145-160.
2001
-
Fullerenes and coordination polyhedra versus half-cube embeddings.
192:41-80.
1998
-
A family of sparse graphs of large sum number.
141:163-171.
1995
-
Packing pentagons into complete graphs: how clumsy can you get?.
128:305-316.
1994
-
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs.
114:199-203.
1993
-
Halving Steiner triple systems.
109:59-67.
1992
-
Graphs of maximum diameter.
102:121-141.
1992
-
Preface.
97:1-1.
1991
-
The fine structure of threefold triple systems: υ ≡ 1 or 3 (mod 6).
92:49-64.
1991
-
Closed form expressions for the iterated floor function.
91:317-321.
1991
-
Partitioning Steiner triple systems into complete arcs.
89:149-160.
1991
-
On Alspach's conjecture.
77:97-121.
1989
-
On the (15, 5, λ)-family of BIBDs.
77:205-216.
1989
-
Repeated blocks in indecomposable twofold triple systems.
65:261-276.
1987
-
On an inclusion-exclusion formula based on the reflection principle.
64:281-288.
1987
-
On the distribution in a graph process.
50:319-322.
1984
-
Completing small partial triple systems.
45:165-179.
1983
-
Steiner triple systems with rotational automorphisms.
33:57-66.
1981
-
On a variation of the Oberwolfach problem.
27:261-277.
1979
-
Enumeration of higher-dimensional paths under restrictions.
26:119-128.
1979
-
Steiner quadruple systems - a survey.
22:147-181.
1978
-
Higher dimensional lattice paths with diagonal steps.
15:137-140.
1976
-
Another class of balanced graph designs: balanced circuit designs.
12:269-293.
1975
-
Finite embedding theorems for partial Steiner triple systems.
13:31-39.
1975
-
Graph decompositions, handcuffed prisoners and balanced P-designs.
2:229-252.
1972
-
On reverse Steiner triple systems.
2:61-71.
1972
has subject area
Identity
International Standard Serial Number (ISSN)
Electronic International Standard Serial Number (EISSN)