default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 53
Volume 53, June 2012
- Patrick Bahls:
On the independence polynomials of path-like graphs. 3-18 - Magda Dettlaff, Magdalena Lemanska:
Influence of edge subdivision on the convex domination number. 19-30 - Toufik Mansour, Mark Shattuck:
Set partitions as geometric words. 31-40 - Matthias Böhm:
k-regular antichains on [m] with k ≤ m-2. 41-52 - Michitaka Furuya:
Construction of (γ, k)-critical graphs. 53-66 - Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray:
b-coloring of some bipartite graphs. 67-76 - Eugen Mandrescu:
Unimodality of some independence polynomials via their palindromicity. 77-82 - Harris Kwong, Sin-Min Lee, Sheng-Ping Bill Lo, Hsin-Hao Su, Yung-Chin Wang:
On uniformly balanced graphs. 83-96 - Danny Dyer, Rebecca Milley:
A time-constrained variation of the Watchman's Walk problem. 97-108 - Catarina P. Avelino, Altino F. Santos:
Spherical and planar folding tessellations by kites and equilateral triangles. 109-126 - Robert A. Beeler, D. Paul Hoilman:
Peg solitaire on the windmill and the double star graphs. 127-134 - Gurusamy Rengasamy Vijayakumar:
Some results on near factorizations of boolean groups. 135-140 - S. Monikandan, J. Balakumar:
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two. 141-150 - Danny Dyer, Ian Payne, Nabil Shalaby, Brenda Wicks:
On the graceful labelling of triangular cacti conjecture. 151-170 - Jana Siagiová, Jozef Sirán:
Covalence sequences of transitive plane tessellations and transitive maps on surfaces. 171-178 - Mirka Miller, Oudone Phanalasy, Joe Ryan, Leanne Rylands:
Antimagicness of some families of generalized graphs. 179-190 - Hongyu Liang:
Computational complexity of the negative decision number of graphs. 191-206 - Dan Gannon, Saad I. El-Zanati:
All 2-regular graphs with uniform odd components admit ρ-labellings. 207-220 - Tina Helms, Heather Jordon, Maggie Murray, Stephanie Zeppetello:
Extended Skolem type difference sets. 221-236 - S. Arumugam, M. Nalliah:
Super (a, d)-edge antimagic total labelings of friendship graphs. 237-244 - Richard A. Brualdi, Kathleen Kiernan, Seth A. Meyer, Michael W. Schroeder:
Cyclic matching sequencibility of graphs. 245-256 - Quan-Hui Yang, Feng-Juan Chen:
Partitions of ℤm with the same representation functions. 257-262 - Omar Bin Saeed Al-Mushayt, Ali Ahmad, Muhammad Kamran Siddiqui:
On the total edge irregularity strength of hexagonal grid graphs. 263-272 - Andrzej Wloch:
On 2-dominating kernels in graphs. 273-284 - Hamid-Reza Fanaï:
Permanent rank and transversals. 285-288 - Mustapha Chellali, Nader Jafari Rad:
k-independence critical graphs. 289-298 - Brendon Stanton:
Vertex identifying codes for the n-dimensional lattice. 299-
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 2025-05-02 23:43 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
