default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 58
Volume 58, February 2014
- Dalibor Froncek, Amy Hlavacek, Steven J. Rosenberg:
Edge reconstruction and the swapping number of a graph. 1-15 - Dan Archdeacon, C. Paul Bonnington, Jozef Sirán:
Regular pinched maps. 16-26 - Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Inflations of geometric grid classes: three case studies. 27-47 - Gary Chartrand, Heather Jordan, Ping Zhang:
A cycle decomposition conjecture for Eulerian graphs. 48-59 - Saieed Akbari, Hossein Esfandiari, E. Barzegary, Saeed Seddighin:
Some bounds for the signed edge domination number of a graph. 60-66 - Anuradha Sharma, Amit K. Sharma:
MacWilliams identities for m-spotty weight enumerators of codes over rings. 67-105 - Fu-Tao Hu, Jun-Ming Xu:
Roman bondage numbers of some graphs. 106-118 - Martin Knor, Riste Skrekovski:
Wiener index of generalized 4-stars and of their quadratic line graphs. 119-126 - Bo Ning:
Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs. 127-136 - Lori MacDonald, Paul S. Wenger, Scott Wright:
Total acquisition on grids. 137-156 - Rebecca Smith, Vincent Vatter:
A stack and pop stack in series. 157-171 - Sizhong Zhou, Jie Wu, Quanru Pan:
A result on fractional ID-[a, b]-factor-critical graphs. 172-177 - Ghislain Fourier:
Extended partial order and applications to tensor products. 178-196 - Julian A. Allagan, David Slutzky:
Chromatic polynomials of some mixed hypergraphs. 197-213
- Paul C. Leopardi:
Constructions for Hadamard matrices, Clifford algebras, and their relation to amicability / anti-amicability graphs. 214-248 - Christina M. Mynhardt, Mark Schurch:
A construction of a class of graphs with depression three. 249-263 - Zsófia Kereskényi-Balogh, Gábor Nyul:
Stirling numbers of the second kind and Bell numbers for graphs. 264-274 - Stéphane Legendre:
Foldings and meanders. 275-291 - Wannee Lapchinda, Narong Punnim, Nittiya Pabhapote:
GDDs with two associate classes and with three groups of sizes 1, n and n. 292-303 - Xueliang Li, Yaping Mao, Yuefang Sun:
On the generalized (edge-)connectivity of graphs. 304-319 - Landan Hicks, Marc J. Lipman, Matt Walsh:
A colour-sliding problem on graphs. 320-332 - Ebrahim Ghaderpour, Hadi Kharaghani:
The asymptotic existence of orthogonal designs. 333-346 - Alexey Pokrovskiy:
Edge growth in graph powers. 347-357
- K. M. Kathiresan, S. Akila Devi:
A study on H-line graphs. 358-364 - Fatma Al-Kharousi, R. Kehinde, Abdullahi Umar:
Combinatorial results for certain semigroups of partial isometries of a finite chain. 365-375 - Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
A characterisation of eccentric sequences of maximal outerplanar graphs. 376-
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 2026-07-17 01:06 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
