default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 156
Volume 156, Numbers 1-3, September 1996
- Stephen J. Curran, Joseph A. Gallian:
Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. 1-18 - R. Balakrishnan, R. Sampathkumar:
Decompositions of regular graphs into Knc v 2K2. 19-28 - M. Bauer, C. Itzykson:
Triangulations. 29-81 - Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross:
A tight lower bound on the maximum genus of a simplicial graph. 83-102 - Hortensia Galeana-Sánchez:
On monochromatic paths and monochromatic cycles in edge coloured tournaments. 103-112 - David W. Krumme:
Reordered gossip schemes. 113-140 - Jin Ho Kwak, Se-Goo Kim, Jaeun Lee:
Distributions of regular branched prime-fold coverings of surfaces. 141-170 - Mingchu Li:
Hamiltonian cycles in regular 3-connected claw-free graphs. 171-196 - Valery A. Liskovets
:
A reductive technique for enumerating non-isomorphic planar maps. 197-217 - Ioan Tomescu:
An asymptotic formula for the number of graphs having small diameter. 219-228 - Xuding Zhu:
On the bounds for the ultimate independence ratio of a graph. 229-236 - J. H. E. Cohn:
Complex D-optimal designs. 237-241 - Sandi Klavzar, Blaz Zmazek:
On a Vizing-like conjecture for direct product graphs. 243-246 - Winston Yang:
Bell numbers and k-trees. 247-252 - Richard P. Anstee, Jerrold R. Griggs:
An application of matching theory of edge-colourings. 253-256 - Béla Bollobás:
Turán-Ramsey problems. 257-262 - Keith Edwards:
On a problem concerning piles of counters. 263-264 - Henry Jacob:
Kernels in graphs with a clique-cutset. 265-267 - Donald L. Kreher, Gordon F. Royle, W. D. Wallis:
A family of resolvable regular graph designs. 269-275 - Vaktang Lashkia, Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg:
Semirigid sets of diamond orders. 277-283 - Miwako Mishima, Masakazu Jimbo:
A series of identities for the coefficients of inverse matrices on a Hamming scheme. 285-290 - Haiko Müller:
Hamiltonian circuits in chordal bipartite graphs. 291-298 - Elefterie Olaru:
The structure of imperfect critically strongly-imperfect graphs. 299-302 - James A. Sellers:
Recurrences for 2-colored and 3-colored F-partitions. 303-310 - Manfred Stern:
On the covering graph of balanced lattices. 311-316 - Xuebin Zhang:
Construction for indecomposable simple (v, k, lambda)-BIBDs. 317-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 2024-11-08 20:37 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:
