<h2>Volume 2 (1990)</h2>

<ul>
<li>N. Achuthan, N.R. Achuthan and L. Caccetta
<ul>
<li>On the Nordhaus-Gaddum class problems, p.5</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p5.pdf">Download Full T
ext</a> (1261Kb pdf)</li>
</ul>
</li>
<li>N.R. Achuthan and M. Simanihuruk
<ul>
<li>On potentially $P$-graphic degree sequences, p.29</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p29.pdf">Download Full
Text</a> (675Kb pdf)</li>
</ul>
</li>
<li>Brian Alspach and Katherine Heinrich
<ul>
<li>Matching designs, p.39</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p39.pdf">Download Full
Text</a> (1536Kb pdf)</li>
</ul>
</li>
<li>Sheng Bau
<ul>
<li>Cycles containing a set of elements in cubic graphs, p.57</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p57.pdf">Download Full
Text</a> (1822Kb pdf)</li>
</ul>
</li>
<li>F.E. Bennett
<ul>
<li>Pairwise balanced designs with block sizes 4 and 8, p.77</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p77.pdf">Download Full
Text</a> (2010Kb pdf)</li>
</ul>
</li>
<li>K. Budayasa and L. Caccetta
<ul>
<li>On critically $k$-edge-connected graphs, p.101</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p101.pdf">Download Full
Text</a> (583Kb pdf)</li>
</ul>
</li>
<li>Yeow Meng Chee, Charles J. Colbourn, Steven C. Furino and Donald L. Kreher
<ul>
<li>Large sets of disjoint $t$-designs, p.111</li>

<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A

ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p111.pdf">Download Full
Text</a> (757Kb pdf)</li>
</ul>
</li>
<li>Roger B. Eggleton, Latif A. Al-Hakim and James MacDougall
<ul>
<li>Braced edges in plane triangulations, p.121</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p121.pdf">Download Full
Text</a> (1304Kb pdf)</li>
</ul>
</li>
<li>Bill Jackson and Nicholas C. Wormald
<ul>
<li>$k$-walks of graphs, p.135</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p135.pdf">Download Full
Text</a> (1359Kb pdf)</li>
</ul>
</li>
<li>A. Meir and J.W. Moon
<ul>
<li>On the maximum out-degree in random trees, p.147</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p147.pdf">Download Full
Text</a> (644Kb pdf)</li>
</ul>
</li>
<li>Alan Rahilly
<ul>
<li>Semiregular group divisible designs whose duals are semiregular, p.157</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p157.pdf">Download Full
Text</a> (1817Kb pdf)</li>
</ul>
</li>
<li>R.G. Stanton and R.W. Buskens
<ul>
<li>An upper approximation to the BIBD (15,21,7,5,2), p.181</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p181.pdf">Download Full
Text</a> (999Kb pdf)</li>
</ul>
</li>
<li>Marta Sved and Robert J. Clarke
<ul>
<li>King's walk on the infinite chessboard, p.191</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p191.pdf">Download Full
Text</a> (1939Kb pdf)</li>
</ul>
</li>

<li>Roberto Tamassia
<ul>
<li>Drawing algorithms for planar $st$-graphs, p.217</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p217.pdf">Download Full
Text</a> (1395Kb pdf)</li>
</ul>
</li>
<li>W.D. Wallis
<ul>
<li>Not all perfect extrinsic secret sharing schemes are ideal, p.237</li>
<li><a href="D:/Kegiatan Kampus/01. Penelitian Dosen/1 Jurnal Kombinatorik/The A
ustralasian Journal of Combinatorics/Volume 2/ocr-ajc-v2-p237.pdf">Download Full
Text</a> (213Kb pdf)</li>
</ul>
</li>
</ul>