![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 2006
- 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. Australas. J Comb. 34: 137-144 (2006) - Ying Zhao, Yejing Wang, Jennifer Seberry:
On amicable orthogonal designs of order 8. Australas. J Comb. 34: 321-330 (2006) - Peter Abramenko, Hendrik Van Maldeghem:
Combinatorial characterizations of convexity and apartments in buildings. Australas. J Comb. 34: 89-104 (2006) - Peter Adams, Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs:
Diagonally switchable 4-cycle systems. Australas. J Comb. 34: 145-152 (2006) - Irène Charon, Olivier Hudry, Antoine Lobstein:
Possible cardinalities for locating-dominating codes in graphs. Australas. J Comb. 34: 23-32 (2006) - Robert Craigen:
Products and factorizations of ternary complementary pairs. Australas. J Comb. 34: 269-280 (2006) - Kevin K. Ferland, Megan L. Holben:
The tough sets for the generalized Petersen graphs G(n, 2). Australas. J Comb. 34: 211-228 (2006) - L. F. Fitina, S. P. Lal:
Access schemes based on perfect critical set partitions and transformations. Australas. J Comb. 34: 229-238 (2006) - Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Fractional isometric path number. Australas. J Comb. 34: 281-298 (2006) - Jun Fujisawa, Katsuhiro Ota:
Weighted Ramsey problem. Australas. J Comb. 34: 331-342 (2006) - Olexandr Ganyushkin, Volodymyr Mazorchuk:
Combinatorics and distributions of partial injections. Australas. J Comb. 34: 161-186 (2006) - Gregory Z. Gutin, Arash Rafiey:
Multipartite tournaments with small number of cycles. Australas. J Comb. 34: 17-22 (2006) - Bert L. Hartnell, Douglas F. Rall:
On graphs having uniform size star factors. Australas. J Comb. 34: 305-312 (2006) - Sabine Klinkenberg, Lutz Volkmann:
On the order of almost regular graphs without a matching of given size. Australas. J Comb. 34: 187-194 (2006) - Midori Kobayashi, Gisaku Nakamura:
Uniform coverings of 2-paths with 6-cycles in the complete graph. Australas. J Comb. 34: 299-304 (2006) - Khee Meng Koh, Eng Guan Tay:
On optimal orientations of tree vertex-multiplications. Australas. J Comb. 34: 69-88 (2006) - Lubica Liskova:
Cayley maps with given exponents and distribution of inverses. Australas. J Comb. 34: 3-16 (2006) - Richard M. Low, Sin-Min Lee:
On the products of group-magic graphs. Australas. J Comb. 34: 41-48 (2006) - Richard M. Low, Sin-Min Lee:
On the integer-magic spectra of tessellation graphs. Australas. J Comb. 34: 195-210 (2006) - Vadim V. Lozin, Dieter Rautenbach:
The tree- and clique-width of bipartite graphs in special classes. Australas. J Comb. 34: 57-68 (2006) - J. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart:
Quadrangularity and strong quadrangularity in tournaments. Australas. J Comb. 34: 247-260 (2006) - Doostali Mojdeh:
On conjectures on the defining set of (vertex) graph colourings. Australas. J Comb. 34: 153-160 (2006) - Joanna Raczek:
Lower bound on the paired domination number of a tree. Australas. J Comb. 34: 343- (2006) - Shang-wang Tan, Ji-Ming Guo:
The second largest eigenvalue of trees. Australas. J Comb. 34: 313-320 (2006) - Xuezhong Tan, Bolian Liu:
On the spectrum of the quasi-laplacian matrix of a graph. Australas. J Comb. 34: 49-56 (2006) - Stephen Taylor, Ian M. Wanless, Natashia L. Boland:
Distance domination and amplifier placement problems. Australas. J Comb. 34: 117-136 (2006) - David R. Wood:
Characterisations of intersection graphs by vertex orderings. Australas. J Comb. 34: 261-268 (2006) - Tianbing Xia, Ming-Yuan Xia, Jennifer Seberry, Jing Wu:
Hadamard matrices constructed by circulant and negacyclic matrices. Australas. J Comb. 34: 105-116 (2006) - Xuebin Zhang:
Compatibly ordered Room squares. Australas. J Comb. 34: 33-40 (2006) - Yongqiang Zhao, Wenjie He:
Note on competition and phylogeny numbers. Australas. J Comb. 34: 239-246 (2006)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-18 07:50 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint