default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 42
Volume 42, Number 1, 1982
- Atsushi Amahashi, Mikio Kano:
On factors with given components. 1-6 - Frank W. Barnes:
Algebraic theory of brick packing I. 7-26 - József Beck:
On a generalization of Kaplansky's game. 27-35 - Albrecht Beutelspacher:
On extremal intersection numbers of a block design. 37-49 - Medha Dhurandhar:
Improvement on Brooks' chromatic bound for a class of graphs. 51-56 - Paul Erdös, Arthur M. Hobbs, C. Payan:
Disjoint cliques and disjoint maximal independent sets of vertices in graphs. 57-61 - Michael S. Jacobson:
On the Ramsey multiplicity for stars. 63-66 - Meir Katchalski, Ted Lewis:
Cutting rectangles in the plane. 67-71 - Markos V. Koutras
:
Non-central stirling numbers and some applications. 73-89 - Aeryung Moon:
Characterization of the odd graphs Ok by parameters. 91-97 - Ronald C. Read, Robert W. Robinson:
Enumeration of labelled multigraphs by degree parities. 99-105 - Á. Varecza:
Are two given elements neighbouring? 107-117 - Svatopluk Poljak, Daniel Turzík:
A note on sticky matroids. 119-123 - Myriam Preissmann:
Snarks of order 18. 125-126
Volume 42, Numbers 2-3, 1982
- Frank W. Barnes:
Algebraic theory of brick packing II. 129-144 - André Bouchet, R. Lopez-Bracho:
Decomposition of a complete graph into trails of given lengths. 145-152 - Chung Je Cho:
Rotational Steiner triple systems. 153-159 - Anne Delandtsheer:
Finite planar spaces with isomorphic planes. 161-176 - Odile Favaron:
Very well covered graphs. 177-187 - Ronald J. Gould, Michael S. Jacobson:
Forbidden subgraphs and Hamiltonian properties of graphs. 189-196 - L. Guerra, Emanuela Ughi:
On the distribution of legendre symbols in galois fields. 197-208 - Kevin Keating:
The conjunction of Cayley digraphs. 209-219 - A. Machì:
On the complexity of a hypermap. 221-226 - Dragan Marusic, Torrence D. Parsons:
Hamiltonian paths in vertex-symmetric graphs of order 5p. 227-242 - Hiroshi Narushima:
Principle of inclusion-exclusion on partially ordered sets. 243-250 - Donald W. Newhart:
Information sets in quadratic-residue codes. 251-266 - Rhodes Peele:
On finite partition representations of lattices. 267-280 - Carla D. Savage:
Short strings containing all k-element permutations. 281-285 - Thomas Zaslavsky:
Chromatic invariants of signed graphs. 287-312 - Lothar Collatz:
Equipartition with square numbers. 313-316 - Arthur M. Hobbs, Edward F. Schmeichel:
On the maximum number of independent edges in cubic graphs. 317-320 - David Billington:
A simple proof that all 1-designs exist. 321-322
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
