default search action
Discrete Mathematics, Volume 43
Volume 43, Number 1, 1983
- Rudolf Berghammer, Gunther Schmidt
:
Discrete ordering relations. 1-7 - Prabir Das, S. B. Rao:
Alternating eulerian trails with prescribed degrees in two edge-colored complete graphs. 9-20 - Pierre Duchet, Henry Meyniel:
Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes. 21-27 - J.-C. Fournier:
Hypergraphes de chaines d'aretes d'un arbre. 29-36 - Martin Charles Golumbic, Doron Rotem, Jorge Urrutia:
Comparability graphs and intersection graphs. 37-46 - R. H. Jeurissen:
Disconnected graphs with magic labelings. 47-53 - János Komlós, Endre Szemerédi:
Limit distribution for the existence of hamiltonian cycles in a random graph. 55-63 - Clement W. H. Lam:
Non-skew symmetric orthogonal matrices with constant diagonals. 65-78 - Josef Lauri:
Proof of Harary's conjecture on the reconstruction of trees. 79-90 - Dragan Marusic
Hamiltonian paths in vertex-symmetric graphs of order 4p. 91-96 - Peter Stein:
On Chvátal's conjecture related to a hereditary system. 97-105 - Pavel M. Blecher:
On a logical problem. 107-110 - Bernt Lindström:
Undecided Ramsey-Numbers for Paths. 111-112 - Helmut Prodinger:
Non-repetitive sequences and gray code. 113-116 - Frank Ruskey
A simple proof of a formula of Dershowitz and Zaks. 117-118 - P. K. Wong:
On the smallest graphs of girth 10 and valency 3. 119-124 - David L. Reiner:
A q-analog of the campbell-baker-hausdorff formula. 125-129
Volume 43, Numbers 2-3, 1983
- Raul Cordovil:
The directions determined by n points in the plane: a matroidal generalization. 131-137 - Karel Culík II, Juhani Karhumäki:
Systems of equations over a free monoid and Ehrenfeucht's conjecture. 139-153 - Michel Dehon:
On the existence of 2-designs Slambda(2, 3, upsilon) without repeated blocks. 155-171 - Martin Farber:
Characterizations of strongly chordal graphs. 173-189 - Darald J. Hartfiel:
Stochastic eigenvectors for qualitative stochastic matrices. 191-197 - Joseph Douglas Horton:
The construction of Kotzig factorizations. 199-206 - R. H. Jeurissen:
Pseudo-magic graphs. 207-214 - Terry A. McKee:
Duality principles for binary matroids and graphs. 215-222 - Richard J. Nowakowski
The smallest graph variety containing all paths. 223-234 - Richard J. Nowakowski
Vertex-to-vertex pursuit in a graph. 235-239 - Sergiu Rudeanu:
Linear Boolean equations and generalized minterms. 241-248 - Masako Sato, Thien Tran Cong:
The number of minimal lattice paths restricted by two parallel lines. 249-261 - Dieter Schäfer, Karl Erich Wolff:
Pólya enumeration of expansions of resolvable incidence structures. 263-271 - Howard Straubing:
A combinatorial proof of the Cayley-Hamilton theorem. 273-279 - Henk Jan Veldman:
Existence of dominating cycles and paths. 281-296 - David Witte, Gail Letzter, Joseph A. Gallian:
On hamiltonian circuits in cartesian products of Cayley digraphs. 297-307 - Joseph Zaks:
Extending two theorems of A. Kotzig. 309-315 - François Bry
On the factorization of graphs with exactly one vertex of infinite degree. 317-320 - Peter Stein:
Chvátal's conjecture and point-intersections. 321-323 - Peter Frankl:
A probabilistic proof for the lym-inequality. 325
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 2024-11-22 19:45 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: