Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Australasian Journal of Combinatorics, Volume 34
Volume 34, February 2006
- Lubica Liskova:
Cayley maps with given exponents and distribution of inverses. 3-16 - Gregory Z. Gutin, Arash Rafiey:
Multipartite tournaments with small number of cycles. 17-22 - Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for locating-dominating codes in graphs. 23-32 - Xuebin Zhang:
Compatibly ordered Room squares. 33-40 - Richard M. Low, Sin-Min Lee:
On the products of group-magic graphs. 41-48 - Xuezhong Tan, Bolian Liu:
On the spectrum of the quasi-laplacian matrix of a graph. 49-56 - Vadim V. Lozin, Dieter Rautenbach:
The tree- and clique-width of bipartite graphs in special classes. 57-68 - Khee Meng Koh, Eng Guan Tay:
On optimal orientations of tree vertex-multiplications. 69-88 - Peter Abramenko, Hendrik Van Maldeghem:
Combinatorial characterizations of convexity and apartments in buildings. 89-104 - Tianbing Xia, Ming-Yuan Xia, Jennifer Seberry, Jing Wu:
Hadamard matrices constructed by circulant and negacyclic matrices. 105-116 - Stephen Taylor, Ian M. Wanless, Natashia L. Boland:
Distance domination and amplifier placement problems. 117-136 - Ying Zhao, Jennifer Seberry, Tianbing Xia, Yejing Wang, Beata J. Wysocki, Tadeusz A. Wysocki, Le Chung Tran:
Amicable orthogonal designs of order 8 for complex space-time block codes. 137-144 - Peter Adams, Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs:
Diagonally switchable 4-cycle systems. 145-152 - Doostali Mojdeh:
On conjectures on the defining set of (vertex) graph colourings. 153-160 - Olexandr Ganyushkin, Volodymyr Mazorchuk:
Combinatorics and distributions of partial injections. 161-186 - Sabine Klinkenberg, Lutz Volkmann:
On the order of almost regular graphs without a matching of given size. 187-194 - Richard M. Low, Sin-Min Lee:
On the integer-magic spectra of tessellation graphs. 195-210 - Kevin K. Ferland, Megan L. Holben:
The tough sets for the generalized Petersen graphs G(n, 2). 211-228 - L. F. Fitina, S. P. Lal:
Access schemes based on perfect critical set partitions and transformations. 229-238 - Yongqiang Zhao, Wenjie He:
Note on competition and phylogeny numbers. 239-246 - J. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart:
Quadrangularity and strong quadrangularity in tournaments. 247-260 - David R. Wood:
Characterisations of intersection graphs by vertex orderings. 261-268 - Robert Craigen:
Products and factorizations of ternary complementary pairs. 269-280 - Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Fractional isometric path number. 281-298 - Midori Kobayashi, Gisaku Nakamura:
Uniform coverings of 2-paths with 6-cycles in the complete graph. 299-304 - Bert L. Hartnell, Douglas F. Rall:
On graphs having uniform size star factors. 305-312 - Shang-wang Tan, Ji-Ming Guo:
The second largest eigenvalue of trees. 313-320 - Ying Zhao, Yejing Wang, Jennifer Seberry:
On amicable orthogonal designs of order 8. 321-330 - Jun Fujisawa, Katsuhiro Ota:
Weighted Ramsey problem. 331-342 - Joanna Raczek:
Lower bound on the paired domination number of a tree. 343-
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-04-25 04:48 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:
