Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 32
Volume 32, June 2005
- Hung-Lin Fu:
Balanced bipartite 4-cycle designs. 3-26 - Peter A. B. Pleasants, Harry Ray, Jamie Simpson:
The Frobenius problem on lattices. 27-46 - William C. Calhoun, Kevin Ferland, Lisa Lister, John B. Polhill:
Totally magic labelings of graphs. 47-60 - Ming-Yuan Xia, Tianbing Xia, Jennifer Seberry, Guoxin Zuo:
A new method for constructing T-matrices. 61-78 - Shinya Fujita:
Partition of a graph into cycles and isolated vertices. 79-90 - Lynne L. Doty, Kevin K. Ferland:
Supertough graphs need not be K1, 3-free. 91-104 - Yoshimi Egawa, Masao Tsugaki:
A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected. 105-110 - Sheshayya A. Choudum, M. A. Shalu:
The class of {3K1, C4}-free graphs. 111-116 - Weizhen Gu, Xingde Jia, Haidong Wu:
Chords in graphs. 117-124 - Atif A. Abueida, Mike Daven, Kenneth J. Roblee:
Multidesigns of the λ-fold complete graph for graph-pairs of orders 4 and 5. 125-136 - Mary Waterhouse:
Some equitably 2 and 3-colourable cube decompositions. 137-146 - Narong Punnim:
Decycling regular graphs. 147-162 - Thomas Lam:
A result on 2k-cycle-free bipartite graphs. 163-170 - Tsuyoshi Nishimura:
Note on a closure concept and matching extension. 171-176 - Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for identifying codes in graphs. 177-196 - Yan Zhang, Beiliang Du:
The existence of resolvable Mendelsohn designs RMD({3, s*}, v). 197-204 - G. Sethuraman, A. Elumalai:
Gracefulness of a cycle with parallel Pk-chords. 205-212 - K. T. Arasu, Surinder K. Sehgal:
Cyclic difference covers. 213-224 - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
On edge-magic labelings of certain disjoint unions of graphs. 225-242 - Ashish Das, Aloke Dey, Sanpei Kageyama, Kishore Sinha:
A-efficient balanced treatment incomplete block designs. 243-252 - Mukul S. Bansal, V. Ch. Venkaiah:
A note on finding a maximum clique in a graph using BDDs. 253-258 - Ngo Dac Tan, Tran Minh Tuoc:
An algorithm for determining connectedness of tetravalent metacirculant graphs. 259-278 - Igor E. Zverovich, Inessa I. Zverovich:
Ratio of generalized stability and domination parameters. 279-284 - Nicholas J. Cavenagh, Diane M. Donovan, Ales Drápal:
4-homogeneous latin trades. 285-304 - Mohammed M. M. Jaradat, Maref Y. Alzoubi:
An upper bound of the basis number of the lexicographic product of graphs. 305-312 - Masoud Ariannejad, M. Emami:
Notes on the structure of support in BIB designs. 313-322 - Elizabeth J. Billington, Charles C. Lindner, Alexander Rosa:
Lambda-fold complete graph decompositions into perfect four-triple configurations. 323-330 - Emine Sule Yazici:
Metamorphosis of 2-fold 4-cycle systems into maximum packings of 2-fold 6-cycle systems. 331-338 - W. D. Wallis, R. A. Yates:
On totally magic injections. 339-
a service of 
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 2024-07-02 21:37 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:
