Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 46
Volume 46, Number 1, 1983
- N. G. Bate:
Complete graphs without polychromatic circuits. 1-8 - Kenneth A. Berman:
Proof of a conjecture of Häggkvist on cycles and independent edges. 9-13 - Brad Jackson, Gerhard Ringel:
Maps of m-pires on the projective plane. 15-20 - S. Kounias, M. Lefkopoulou, C. Bagiatis:
G-optimal N-observation first order 2k designs. 21-31 - Shinji Kuriki, Masakazu Jimbo:
On 1-rotational Slambda(2, 3, nu) designs. 33-40 - Isabel Loureiro:
Finitely generated free tetravalent modal algebras. 41-48 - Dragan Marusic
:
Hamiltonian circuits in Cayley graphs. 49-54 - Erich Durnberger:
Connected Cayley graphs of semi-direct products of cyclic groups of prime order by abelian groups are hamiltonian. 55-68 - K. R. Parthasarathy, R. Nandakumar:
Unique eccentric point graphs. 69-74 - Ákos Seress:
Gossiping old ladies. 75-81 - James B. Shearer:
A note on the independence number of triangle-free graphs. 83-87 - François Jaeger:
The 1-factorization of some line-graphs. 89-92 - François Jaeger, Charles Payan, Mekkia Kouider:
Partition of odd regular graphs into bistars. 93-94 - William M. Kantor:
Exponential numbers of two-weight codes, difference sets and symmetric designs. 95-98 - Eugene Levine:
On a harmonious graph conjecture. 99-101 - Amram Meir, John W. Moon:
On an asymptotic evaluation of the cycle index of the symmetric group. 103-105 - Rodica Simion, Frank W. Schmidt:
On (+1, -1)-matrices with vanishing permanent. 107-108 - Wenceslas Fernandez de la Vega:
On the maximum density of graphs which have no subcontraction to K3. 109-110
Volume 46, Number 2, 1983
- J. L. Brenner, R. C. Lyndon:
Infinite Eulerian tessellations. 111-132 - Michael Capobianco, Ove Frank:
Graph evolution by stochastic additions of points and lines. 133-143 - Paul Erdös, Zbigniew Palka:
Trees in random graphs. 145-150 - Ralph J. Faudree, J. Sheehan:
Size Ramsey numbers involving stars. 151-157 - Claude Flament, Bruno Leclerc:
Arbres minimaux d'un graphe preordonne. 159-171 - Katherine Heinrich, Anthony J. W. Hilton:
Doubly diagonal orthogonal latin squares. 173-182 - Alexander K. Kelmans, M. V. Lomonosov:
On cycles through prescribed vertices in weakly separable graphs. 183-189 - Richard D. Ringeisen, Marc J. Lipman:
Cohesion and stability in graphs. 191-198 - Noga Alon:
On the density of sets of vectors. 199-202 - Béla Bollobás:
Some remarks on packing trees. 203-204 - Helmut Prodinger:
A correspondence between ordered trees and noncrossing partitions. 205-206 - Jules Varlet:
Relative de Morgan lattices. 207-209 - Andrew Vince:
An algebraic theory of graph factorization. 211-213 - Aviezri S. Fraenkel:
Problem 47 : Posed by Aviezri S. Fraenkel. 215-216 - G. L. Sicherman:
Problem 48. 216
Volume 46, Number 3, 1983
- Dominique Buset:
Graphs which are locally a cube. 221-226 - Leo G. Chouinard, Earl S. Kramer, Donald L. Kreher:
Graphical t-wise balanced designs. 227-240 - Mihály Geréb-Graus:
An external theorem on divisors of a number. 241-248 - Masakazu Jimbo, Shinji Kuriki:
On a composition of cyclic 2-designs. 249-255 - Jean François Maurras:
Convex hull of the edges of a graph and near bipartite graphs. 257-265 - Bernard Péroche:
On several sorts of connectivity. 267-277 - S. Ramachandran:
N-reconstructibility of non-reconstructible digraphs. 279-294 - Ratko Tosic:
Two counterfeit coins. 295-298 - Sue Whitesides:
Edge-colored complete graphs with alternating cycles. 299-304 - Dragic Bankovic:
Solving systems of arbitrary equations. 305-309 - Chong-Yun Chao, Jacqueline G. Wells:
On labeled vertex-transitive digraphs with a prime number of vertices. 311-315 - Derek G. Corneil, J. Mark Keil:
A note on a conjecture by Gavril on clique separable graphs. 317-318 - Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel:
Representing a planar graph by vertical lines joining different levels. 319-321 - Frank K. Hwang, Victor K.-W. Wei:
A partition identity. 323-326 - Denise Amar, Evelyne Flandrin, Irène Fournier, Anne Germa:
Hamiltonian pancyclic graphs. 327
a service of 
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-07-21 22:04 CEST 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:
