Discrete Mathematics
, Volume 42
Volume 42, Number 1, 1982
Atsushi Amahashi
,
Mikio Kano
:
On factors with given components.
1-6
Electronic Edition
(link)
BibTeX
Frank W. Barnes
:
Algebraic theory of brick packing I.
7-26
Electronic Edition
(link)
BibTeX
József Beck
:
On a generalization of Kaplansky's game.
27-35
Electronic Edition
(link)
BibTeX
Albrecht Beutelspacher
:
On extremal intersection numbers of a block design.
37-49
Electronic Edition
(link)
BibTeX
Medha Dhurandhar
:
Improvement on Brooks' chromatic bound for a class of graphs.
51-56
Electronic Edition
(link)
BibTeX
Paul Erdös
,
Arthur M. Hobbs
,
C. Payan
:
Disjoint cliques and disjoint maximal independent sets of vertices in graphs.
57-61
Electronic Edition
(link)
BibTeX
Michael S. Jacobson
:
On the Ramsey multiplicity for stars.
63-66
Electronic Edition
(link)
BibTeX
Meir Katchalski
,
Ted Lewis
:
Cutting rectangles in the plane.
67-71
Electronic Edition
(link)
BibTeX
Markos Koutras
:
Non-central stirling numbers and some applications.
73-89
Electronic Edition
(link)
BibTeX
Aeryung Moon
:
Characterization of the odd graphs O
k
by parameters.
91-97
Electronic Edition
(link)
BibTeX
R. C. Read
,
R. W. Robinson
:
Enumeration of labelled multigraphs by degree parities.
99-105
Electronic Edition
(link)
BibTeX
Á. Varecza
:
Are two given elements neighbouring?
107-117
Electronic Edition
(link)
BibTeX
Svatopluk Poljak
,
Daniel Turzík
:
A note on sticky matroids.
119-123
Electronic Edition
(link)
BibTeX
Myriam Preissmann
:
Snarks of order 18.
125-126
Electronic Edition
(link)
BibTeX
Volume 42, Numbers 2-3, 1982
Frank W. Barnes
:
Algebraic theory of brick packing II.
129-144
Electronic Edition
(link)
BibTeX
André Bouchet
,
R. Lopez-Bracho
:
Decomposition of a complete graph into trails of given lengths.
145-152
Electronic Edition
(link)
BibTeX
Chung Je Cho
:
Rotational Steiner triple systems.
153-159
Electronic Edition
(link)
BibTeX
Anne Delandtsheer
:
Finite planar spaces with isomorphic planes.
161-176
Electronic Edition
(link)
BibTeX
Odile Favaron
:
Very well covered graphs.
177-187
Electronic Edition
(link)
BibTeX
Ronald J. Gould
,
Michael S. Jacobson
:
Forbidden subgraphs and Hamiltonian properties of graphs.
189-196
Electronic Edition
(link)
BibTeX
L. Guerra
,
Emanuela Ughi
:
On the distribution of legendre symbols in galois fields.
197-208
Electronic Edition
(link)
BibTeX
Kevin Keating
:
The conjunction of Cayley digraphs.
209-219
Electronic Edition
(link)
BibTeX
A. Machì
:
On the complexity of a hypermap.
221-226
Electronic Edition
(link)
BibTeX
Dragan Marusic
,
T. D. Parsons
:
Hamiltonian paths in vertex-symmetric graphs of order 5p.
227-242
Electronic Edition
(link)
BibTeX
Hiroshi Narushima
:
Principle of inclusion-exclusion on partially ordered sets.
243-250
Electronic Edition
(link)
BibTeX
Donald W. Newhart
:
Information sets in quadratic-residue codes.
251-266
Electronic Edition
(link)
BibTeX
Rhodes Peele
:
On finite partition representations of lattices.
267-280
Electronic Edition
(link)
BibTeX
Carla Savage
:
Short strings containing all k-element permutations.
281-285
Electronic Edition
(link)
BibTeX
Thomas Zaslavsky
:
Chromatic invariants of signed graphs.
287-312
Electronic Edition
(link)
BibTeX
L. Collatz
:
Equipartition with square numbers.
313-316
Electronic Edition
(link)
BibTeX
Arthur M. Hobbs
,
Edward F. Schmeichel
:
On the maximum number of independent edges in cubic graphs.
317-320
Electronic Edition
(link)
BibTeX
David Billington
:
A simple proof that all 1-designs exist.
321-322
Electronic Edition
(link)
BibTeX
Copyright ©
Sat May 16 23:56:46 2009 by
Michael Ley
(
ley@uni-trier.de
)