![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 27 matches
- 2005
- Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein:
1-identifying codes on trees. Australas. J Comb. 31: 21-36 (2005) - Marcel Abas:
Triangular Cayley maps of Kn, n, n. Australas. J Comb. 31: 273-286 (2005) - Atif A. Abueida, Wiebke S. Diestelkamp, Stephanie P. Edwards, Darren B. Parker:
Determining properties of a multipartite tournament from its lattice of convex subsets. Australas. J Comb. 31: 217-230 (2005) - Simona Bonvicini, Gloria Rinaldi:
Minkowski tangent-circle structures and key distribution patterns. Australas. J Comb. 31: 179-188 (2005) - Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. Australas. J Comb. 31: 299-312 (2005) - Darryn E. Bryant, C. David Leach, Christopher A. Rodger:
Hamilton decompositions of complete bipartite graphs with a 3-factor leave. Australas. J Comb. 31: 331-336 (2005) - Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
Altitude of small complete and complete bipartite graphs. Australas. J Comb. 31: 167-178 (2005) - Jessica Cuomo, Nkiruka Nwasokwa, Vadim Ponomarenko:
Jump systems and laminated Manhattan sets. Australas. J Comb. 31: 135-144 (2005) - Steven T. Dougherty:
A new construction of self-dual codes from projective planes. Australas. J Comb. 31: 337- (2005) - Steven T. Dougherty, Manish K. Gupta, Keisuke Shiromoto:
On generalized weights for codes over ℤk. Australas. J Comb. 31: 231-248 (2005) - Beiliang Du:
Splitting balanced incomplete block designs. Australas. J Comb. 31: 287-298 (2005) - Shinya Fujita:
Vertex-disjoint copies of K4- in graphs. Australas. J Comb. 31: 189-200 (2005) - Shu-Guang Guo:
A conjecture on subset sums of a finite set of positive integers. Australas. J Comb. 31: 161-166 (2005) - Manish K. Gupta:
On ℤ4 codes satisfying the chain condition. Australas. J Comb. 31: 263-272 (2005) - Petros Hadjicostas, K. B. Lakshmanan:
Bubble sort with erroneous comparisons. Australas. J Comb. 31: 85-106 (2005) - Mária Ipolyiová:
The minimal polynomial of 2cos(π/p) and its application to regular maps of large planar width. Australas. J Comb. 31: 107-118 (2005) - Anna Lladó, Susana-Clara López Masip:
Minimum tree decompositions with a given tree as a factor. Australas. J Comb. 31: 47-60 (2005) - Toufik Mansour:
Squaring the terms of an ℓth order linear recurrence. Australas. J Comb. 31: 15-20 (2005) - Tomokazu Nagayama, Liang Zhang:
Long cycles through specified edges and vertices. Australas. J Comb. 31: 201-216 (2005) - Vito Napolitano:
On some finite linear spaces with few lines. Australas. J Comb. 31: 145-160 (2005) - Anders Sune Pedersen:
On equality in Berge's classical bound for the domination number. Australas. J Comb. 31: 37-46 (2005) - Ioan Tomescu:
Almost all graphs and h-hypergraphs have small diameter. Australas. J Comb. 31: 313-324 (2005) - Lutz Volkmann, Stefan Winzen:
Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c. Australas. J Comb. 31: 61-84 (2005) - Lutz Volkmann:
Complementary cycles in regular multipartite tournaments. Australas. J Comb. 31: 119-134 (2005) - Weigen Yan, Fuju Zhang:
Indices of convergence on four digraph operators. Australas. J Comb. 31: 249-262 (2005) - Manouchehr Zaker:
Grundy chromatic number of the complement of bipartite graphs. Australas. J Comb. 31: 325-330 (2005) - Igor E. Zverovich, Inessa I. Zverovich:
Closure of K1 + 2K2-free graphs. Australas. J Comb. 31: 3-14 (2005)
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-09-08 02:07 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