![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
The Australasian Journal of Combinatorics, Volume 69
Volume 69, October 2017
- Alain Guillet, Jimmy Leblet, Jean-Xavier Rampon:
Faithful extension on finite order classes. 1-17 - Atthakorn Sakda, Chariya Uiyyasathian:
Group divisible designs GDD(n, n, n, 1; λ1, λ2). 18-28 - Peter Borg, Kurt Fenech:
Reducing the maximum degree of a graph by deleting vertices. 29-40 - James M. Hammer, Dean Hoffman:
Factor pair latin squares. 41-57 - Aloke Dey, Deepayan Sarkar:
A new family of orthogonal Latin hypercube designs. 58-62 - Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh:
On the structure of graphs having a unique k-factor. 63-73 - Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
The chromatic number of ordered graphs with constrained conflict graphs. 74-104 - Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
On 132-representable graphs. 105-118 - Yan-Ting Xie, Shou-Jun Xu:
Nested unimodality. 119-129 - Navid Nasr Esfahani, Douglas R. Stinson:
Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices. 130-144 - Iren Darijani, David A. Pike, Jonathan Poulin:
The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems. 145-158 - Abbas Heydari:
On extremal trees with respect to their terminal distance spectral radius. 159-168 - Kenta Noguchi:
Optimal 1-planar graphs which quadrangulate other surfaces. 169-
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.