default search action
The Australasian Journal of Combinatorics, Volume 56
Volume 56, June 2013
- Christina M. Mynhardt, Jane Wodlinger:
A class of trees with equal broadcast and domination numbers. 3-22 - Jaromy Kuhl, Michael W. Schroeder:
Hamilton cycle decompositions of k-uniform k-partite hypergraphs. 23-38 - Dorota Bród:
On H-dominating matchings and some number partitions. 39-46 - Sarah Spence Adams, Zachary Brass, Connor Stokes, Denise Sakai Troxell:
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. 47-60 - Vesna Andova, Martin Knor, Primoz Potocnik, Riste Skrekovski:
On a variation of the Randíc index. 61-76 - Ben Babcock, Adam Van Tuyl:
Revisiting the spread and covering numbers. 77-84 - Mustapha Chellali, Nader Jafari Rad:
On 2-rainbow domination and Roman domination in graphs. 85-94 - Yancai Zhao, Erfang Shan, Hossein Abdollahzadeh Ahangar:
Signed total domination on Kronecker products of two complete graphs. 95-102 - Ahmed Bouchou, Mostafa Blidia:
Criticality indices of Roman domination of paths and cycles. 103-112 - Iain Beaton, Rory Begin, Stephen Finbow, Christopher M. van Bommel:
Even time constraints on the watchman's walk. 113-122 - Xiaoxia Zhang, Xiangwen Li:
Group connectivity of semistrong product of graphs. 123-132 - Xun-Tuan Su, Deng-Yun Yang, Wei-Wei Zhang:
A note on the generalized factorial. 133-138 - Hiroshi Nozaki:
Lower bounds for the minimum diameter of integral point sets. 139-144 - Vahan V. Mkrtchyan:
A remark on the Petersen coloring conjecture of Jaeger. 145-152 - Qian Huang, Jian-Yi Shi:
The left cells with a-values 5, 6 in the affine Weyl group ~E8. 153-182 - Vladimir Samodivkin:
Note on the bondage number of graphs on topological surfaces. 183-186 - Peter J. Cameron:
Groups with right-invariant multiorders. 187-194 - Salvatore Milici:
A note on uniformly resolvable decompositions of Kv and Kv-I into 2-stars and 4-cycles. 195-200 - Ryan C. Bunge, Saad I. El-Zanati, Chepina Rumsey, Charles Vanden Eynden:
On the cyclic decomposition of circulant graphs into bipartite graphs. 201-218 - Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura, Chie Nara:
3-Perfect hamiltonian decomposition of the complete graph. 219-224 - Søren Bøg, Morten Stöckel, Hjalte Wedel Vildhøj:
The hardness of the functional orientation 2-color problem. 225-234 - Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Palettes in block colourings of designs. 235-244 - Simona Bonvicini, Giuseppe Mazzuoccolo:
Covering cubic graphs with matchings of large size. 245-256 - Stefi Rahmawati, Kiki A. Sugeng, Denny Riama Silaban, Mirka Miller, Martin Baca:
Construction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices. 257-
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.