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 33 matches
- 2007
- S. Arumugam, I. Sahul Hamid:
Simple acyclic graphoidal covers in a graph. Australas. J Comb. 37: 243-256 (2007) - R. Julian R. Abel:
Some new near resolvable BIBDs with k=7 and resolvable BIBDs with k=5. Australas. J Comb. 37: 141-146 (2007) - Alejandro Aguado, Saad I. El-Zanati, Heidi Hake, Jessica Stob, Hera Yayla:
On ρ-labeling the union of three cycles. Australas. J Comb. 37: 155-170 (2007) - Saieed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody:
On rainbow cycles in edge colored complete graphs. Australas. J Comb. 37: 33-42 (2007) - Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Compositions of pattern restricted sets of permutations. Australas. J Comb. 37: 43-56 (2007) - Arthur T. Benjamin, Michael D. Hirschhorn:
A combinatorial solution to intertwined recurrences. Australas. J Comb. 37: 101-116 (2007) - Sarah K. Bleiler, John T. Saccoman:
A correction in the formula for the number of spanning trees in threshold graphs. Australas. J Comb. 37: 205-214 (2007) - David Cariolaro:
On the Ramsey number R(3, 6). Australas. J Comb. 37: 301-304 (2007) - Gang Chen:
A note on potentially K1, 1, t-graphic sequences. Australas. J Comb. 37: 21-26 (2007) - E. J. Cheon:
On the upper bound of the minimum length of 5-dimensional linear codes. Australas. J Comb. 37: 225-232 (2007) - Antonio Cossidente, Giuseppe Marino:
On certain group embeddings in cross characteristic. Australas. J Comb. 37: 147-154 (2007) - Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Perfect hash families from transversal designs. Australas. J Comb. 37: 233-242 (2007) - Edward Dobson:
Packing trees of bounded diameter into the complete graph. Australas. J Comb. 37: 89-100 (2007) - Morteza Esmaeili, T. Aaron Gulliver:
On the [32, 16, 8] BCH and quadratic residue codes. Australas. J Comb. 37: 257-264 (2007) - Yi-Zheng Fan, Haiyan Hong, Shi-Cai Gong, Yi Wang:
Order unicyclic mixed graphs by spectral radius. Australas. J Comb. 37: 305- (2007) - Dmitry Finozhenok, William D. Weakley:
An improved lower bound for domination numbers of the Queen's graph. Australas. J Comb. 37: 295-300 (2007) - Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. Australas. J Comb. 37: 57-66 (2007) - Abdollah Khodkar, Seyed Mahmoud Sheikholeslami:
On perfect double dominating sets in grids cylinders and tori. Australas. J Comb. 37: 131-140 (2007) - Aung Kyaw:
A sufficient condition for spanning trees with bounded maximum degree in a graph. Australas. J Comb. 37: 3-10 (2007) - Magdalena Lemanska:
Lower bound on the weakly connected domination number of a tree. Australas. J Comb. 37: 67-72 (2007) - Shengjia Li, Ruijuan Li, Jinfeng Feng:
The graphs satisfying conditions of Ore's type. Australas. J Comb. 37: 27-32 (2007) - R. S. Manikandan, P. Paulraja:
C5-decompositions of the tensor product of complete graphs. Australas. J Comb. 37: 285-294 (2007) - Vito Napolitano:
Note: A new proof of an inequality for finite planar spaces. Australas. J Comb. 37: 127-130 (2007) - Kiki A. Sugeng, Joe Ryan:
On several classes of monographs. Australas. J Comb. 37: 277-284 (2007) - Lingli Sun:
On the Loebl-Komlós-Sós conjecture. Australas. J Comb. 37: 271-276 (2007) - Andrea Vietri:
On certain 2-rotational cycle systems of complete graphs. Australas. J Comb. 37: 73-80 (2007) - Andrea Vietri:
Nice lists of differences, and their connections with algebraic properties of unitary polynomials. Australas. J Comb. 37: 171-186 (2007) - Stephan G. Wagner:
On the average Wiener index of degree-restricted trees. Australas. J Comb. 37: 187-204 (2007) - Chengde Wang:
More R-sequenceable Groups. Australas. J Comb. 37: 215-224 (2007) - Aihong Wu:
Large sets of disjoint directed and Mendelsohn packing triple systems on 6k+5 points. Australas. J Comb. 37: 81-88 (2007)
skipping 3 more matches
loading more results
failed to load more results, please try again later
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-11-25 21:47 CET 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