Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 14
Volume 14, September 1996
- Frédéric Maire:
Optimizing slightly triangulated graphs. 5-14 - Xueliang Li:
On a conjecture of Merrifield and Simmons. 15-20 - William Klostermeyer:
Path problems in dynamically orientable graphs. 21-30 - Yoichi Higashiyama, Miro Kraetzl, Lou Caccetta:
Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system. 31-36 - Dachang Guo:
5-valent symmetric graphs of order at most 100. 37-50 - Wen-Ai Jackson, Keith M. Martin:
A combinatorial interpretation of ramp schemes. 51-60 - Spyros S. Magliveras, Wandi Wei:
Enumeration of certain binary vectors. 61-76 - Yanjun Li, Mao-cheng Cai:
A degree condition for the existence of connected factors. 77-84 - Scott T. Chapman, Alfred Geroldinger:
On cross numbers of minimal zero sequences. 85-92 - J. Bell, Dragomir Z. Djokovic:
Construction of Baumert-Hall-Welch arrays and T-matrices. 93-108 - Ian Mortimer:
The intersection problem for a five vertex dragon. 109-120 - Robert Jajcay, Jozef Sirán:
More constructions of vertex-transitive non-Cayley graphs based on counting closed walks. 121-132 - Louis Caccetta, Rui-Zhong Jia:
Positive binary labelling of graphs. 133-148 - Peter Kys:
Graphs with equidistant central nodes. 149-156 - David Blokh, Gregory Z. Gutin:
An approximate algorithm for combinatorial optimization problems with two parameters. 157-164 - Marc Gysin, Jennifer Seberry:
Multiplications of ternary complementary pairs. 165-180 - Martin Grüttmüller:
On the number of indecomposable block designs. 181-186 - Hung-Lin Fu, Ming-Chun Tsai:
The maximum genus of diameter three graphs. 187-198 - Martin Knor:
On Ramsey-type games for graphs. 199-206 - Frank E. Bennett, Lie Zhu:
Further results on the existence of HSOLSSOM(hn). 207-220 - Ioan Tomescu:
The number of digraphs with small diameter. 221-228 - Dingjun Lou:
A local neighbourhood condition for n-extendable graphs. 229-234 - Ngo Dac Tan:
On Hamilton cycles in cubic (m, n)-metacirculant graphs, II. 235-258 - L. J. Cummings:
Strongly square-free strings on three letters. 259-266 - Dieter Olpp:
A conjecture of Goodman and the multiplicities of graphs. 267-282 - Wen-Ai Jackson, Keith M. Martin:
Efficient constructions for one sharing of many secrets. 283-296 - Michael E. Raines:
More on embedding partial totally symmetric quasigroups. 297-310 - Tony Moran:
Smallest defining sets for 2-(9, 4, 3) and 3-(10, 5, 3) designs: Corrigendum. 311-
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-05-08 21:48 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:
