default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 70
Volume 70, February 2018
- Xueliang Li, Yan Zhao:
On extremal graphs with exactly one Steiner tree connecting any k vertices. 1-11 - Slobodan Filipovski:
A note on degree/diameter monotonicity of digraphs. 12-14 - Elia Saini:
A new presentation for the inner Tutte group of a matroid. 15-27 - Yaping Mao:
Constructing internally disjoint pendant Steiner trees in Cartesian product networks. 28-51 - A. D. Forbes, Terry S. Griggs:
Designs for graphs with six vertices and nine edges. 52-74 - Mohsen Aliabadi, Mano Vikash Janardhanan:
On local matching property in groups and vector spaces. 75-85 - William J. Keith, Dalibor Froncek, Donald L. Kreher:
A note on nearly platonic graphs. 86-103 - Catarina P. Avelino, Altino F. Santos:
Geometric and combinatorial structure of a class of spherical folding tesselations - II. 104-122 - Mujiangshan Wang, Yuqing Lin, Shiying Wang, Meiyu Wang:
Sufficient conditions for graphs to be maximally 4-restricted edge connected. 123-136 - Lin Chen, Xueliang Li, Henry Liu, Jinfeng Liu:
On various (strong) rainbow connection numbers of graphs. 137-156 - Wai Chee Shiu, Richard M. Low:
The integer-magic spectra and null sets of the Cartesian product of trees. 157-
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 2025-12-04 22:08 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:
