The Australasian Journal of Combinatorics

Volume 68 (2017)

• Part 1

  ---

• Jun Guo
  • Flat graphs based on affine spaces and affine symplectic spaces, pp.1–14

  ---

• S. Mohan, J. Geetha and K. Somasundaram
  • Total coloring of corona product of two graphs, pp.15–22

  ---

• Danny Dyer and Jared Howell
  • The watchman's walk of Steiner triple system block intersection graphs, pp.23–34

  ---

• Dengju Ma
  • The crossing number of the strong product of two paths, pp.35–47

  ---

• Shunsuke Nakamura
  • The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles, pp.48–61

  ---

• Shubhada M. Nyayate, Rajendra M. Pawale and Mohan S. Shrikhande
  • Characterization of quasi-symmetric designs with eigenvalues of their block graphs, pp.62–70

  ---

• Ethan Berkove, David Cervantes Nava, Daniel Condon and Rachel Katz
  • Automorphisms of $S_6$ and the color cubes puzzle, pp.71–93

  ---

• Ali Ovais, Muhammad Awais Umar, Martin Bača and Andrea Semaničová-Feňovčíková
  • Fans are cycle-antimagic, pp.94–105

  ---

• Watcharintorn Ruksasakchai and Tao Wang
  • List strong edge coloring of some classes of graphs, pp.106–117

  ---

• Vito Napolitano
  • Note. An inequality for the line-size sum in a finite linear space, pp.118–121

  ---

• Sascha Kurz
  • Packing vector spaces into vector spaces, pp.122–130

  ---

• Yichao Chen and Tao Wang
  • Recursive formulas for embedding distributions of cubic outerplanar graphs, pp.131–146

  ---

• Qiaoping Guo and Gaokui Xu
  • The structure of strong tournaments containing exactly one out-arc pancyclic vertex, pp.147–152

  ---

• Part 2

  ---

• James Janopaul-Naylor and C. Ryan Vinroot
  • Kostka multiplicity one for multipartitions, pp.153–185

  ---

• Jaromy Kuhl and Donald McGinn
  • On completing partial Latin squares with two filled rows and at least two filled columns, pp.186–201

  ---

• Kazuki Matsubara and Sanpei Kageyama
  • Pairwise additive 1-rotational BIB designs with $\lambda =1$, pp.202–217

  ---

• Alawi Alhashim, Wyatt J. Desormeaux and Teresa W. Haynes
  • Roman domination in complementary prisms, pp.218–228

  ---

• Béla Bajnok and Samuel Edwards
  • On two questions about restricted sumsets in finite abelian groups, pp.229–244

  ---

• Novi H. Bong, Mirka Miller, Joe Ryan and Kiki A. Sugeng
  • MaxDDBS problem on butterfly networks, pp.245–264

  ---

• Nader Jafari Rad and Hailiza Kamarulhaili
  • On the complexity of some bondage problems in graphs, pp.265–275

  ---

• C.C. Lindner, C.A. Rodger and M. Meszka
  • Revisiting the intersection problem for minimum coverings of complete graphs with triples, pp.276–284

  ---

• Ruth Lopez, Jacob Worrell, Henry Wickus, Rigoberto Flórez and Darren A. Narayan
  • Towards a characterization of graphs with distinct betweenness centralities, pp.285–303

  ---

• Wenjing Li, Xueliang Li and Jingshu Zhang
  • The $k$-proper index of complete bipartite and complete multipartite graphs, pp.304–316

  ---

• Fen Chen and Haitao Cao
  • On the existence of $(K_{1,3},\lambda)$-frames of type $g^u$, pp.317–329

  ---

• Part 3

  ---

• Dave Perkins and P. Mark Kayll
  • A chip-firing variation and a Markov chain with uniform stationary distribution, pp.330–345

  ---

• Brice Effantin
  • A note on Grundy colorings of central graphs, pp.346–356

  ---

• Jason Hedetniemi
  • On graphs having a unique minimum independent dominating set, pp.357–370

  ---

• Bret J. Benesh, Dana C. Ernst and Nándor Sieben
  • Impartial achievement games for generating generalized dihedral groups, pp.371–384

  ---

• Fred Rowley
  • Constructive lower bounds for Ramsey numbers from linear graphs, pp.385–395

  ---