default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 78
Volume 78, Numbers 1-2, 1989
- Albert W. Tucker:
Torrence D. Parsons : In memory of Torrence D. Parsons. 1-5 - T. D. Parsons - list of publications. Discret. Math. 78(1-2): 7-9 (1989)
- Mohammed Z. Abu-Sbeih:
Generalizing the duality theorem of graph embeddings. 11-23 - Brian Alspach:
Lifting Hamilton cycles of quotient graphs. 25-36 - A. H. Baartmans, W. D. Wallis:
Indecomposable factorizations of multigraphs. 37-43 - Vladimir Batagelj
:
An inductive definition of the class of 3-connected quadrangulations of the plane. 45-53 - Norman L. Biggs:
A proof of Serre's theorem. 55-57 - André Bouchet:
Maps and Delta-matroids. 59-71 - Neal Brand:
Isomorphisms of cyclic combinatorial objects. 73-81 - Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza:
Induced matchings in bipartite graphs. 83-87 - Nora Hartsfield, Brad Jackson, Gerhard Ringel:
Hamilton surfaces for the complete even symmetric bipartite graph. 89-94 - Douglas Jungreis:
Hamiltonian paths in Cayley digraphs of finitely-generated infinite abelian groups. 95-104 - Stephen C. Locke, Dave Witte:
Flows in circulant graphs of odd order are sums of Hamilton cycles. 105-114 - Judith Q. Longyear:
A peculiar partition formula. 115-118 - Dragan Marusic:
Strong regularity and circulant graphs. 119-125 - William McCuaig:
Existence of graphs with specified cycle lengths. 127-133 - Bojan Mohar:
An obstruction to embedding graphs in surfaces. 135-142 - Torrence D. Parsons, Tomaz Pisanski:
Vector representations of graphs. 143-154 - Tomaz Pisanski:
Universal commutator graphs. 155-156 - Tomaz Pisanski, Thomas W. Tucker:
The genus of low rank hamiltonian groups. 157-167 - Gerald Schrag, Larry Cammack:
On the 2-extendability of the generalized Petersen graphs. 169-177 - Martin Skoviera, Roman Nedela:
The maximum genus of vertex-transitive graphs. 179-186 - Joseph Zaks:
Parsons graphs of matrices. 187-193 - Cun-Quan Zhang:
Bridges of longest cycles. 195-211
Volume 78, Number 3, 1989
- Neal Brand:
On the Bays-Lambossy theorem. 217-222 - Brenda L. Dietrich:
Matroids and antimatroids - a survey. 223-237 - M. Reza Emamy-Khansary, L. Lazarte:
On the cut-complexes of the 5-cube. 239-256 - E. Engelhardt, Victor Klee, K. Li, Howard Quaife:
Minimum graphs of specified diameter, connectivity and valence. II. 257-266 - Z. Hasan:
Intersection of the Steiner systems of M24. 267-289 - Alain Hertz:
Skeletal graphs - a new class of perfect graphs. 291-296 - Stanislav Jendrol', Ernest Jucovic:
On quadrangular convex 3-polytopes with at most two types of edges. 297-305 - Cun-Quan Zhang:
Cycles of given length in some K1, 3-free graphs. 307-313 - Abdón Sánchez-Arroyo:
Determining the total colouring number is np-hard. 315-319 - A. J. van Zanten:
A short proof of a theorem of bannai and ito. 321-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-11 21:18 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:
