Остановите войну!
for scientists:
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 28 matches
- 2004
- R. Julian R. Abel, Diana Combe, William D. Palmer:
Bhaskar Rao designs and the groups of order 12. Australas. J Comb. 29: 301-308 (2004) - Robert E. L. Aldred, Michael D. Plummer:
Edge proximity and matching extension in planar triangulations. Australas. J Comb. 29: 215-224 (2004) - Anton Betten:
Genealogy of t-designs. Australas. J Comb. 29: 3-34 (2004) - E. Boudreau, Bert L. Hartnell, K. Schmeisser, J. Whiteley:
A game based on vertex-magic total labelings. Australas. J Comb. 29: 67-74 (2004) - L. Burnett, William Millan, Ed Dawson, Andrew J. Clark:
Simpler methods for generating better Boolean functions with good cryptographic properties. Australas. J Comb. 29: 231-248 (2004) - Duncan Campbell, Keith Edwards:
A new lower bound for the harmonious chromatic number. Australas. J Comb. 29: 99-102 (2004) - Diana Combe, Adrian M. Nelson, William D. Palmer:
Magic labellings of graphs over finite abelian groups. Australas. J Comb. 29: 259-272 (2004) - Diane M. Donovan, Saad I. El-Zanati, Charles Vanden Eynden, Somporn Sutinuntopas:
Labelings of unions of up to four uniform cycles. Australas. J Comb. 29: 323-336 (2004) - Elaine M. Eschen, Jianbing Niu:
On potentially (K4-e)-graphic sequences. Australas. J Comb. 29: 59-66 (2004) - Henning Fernau:
Complexity of a {0, 1}-matrix problem. Australas. J Comb. 29: 273-300 (2004) - Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs:
Configurations and trades in Steiner triple systems. Australas. J Comb. 29: 75-84 (2004) - Michael U. Gerber, Daniel Kobler:
Classes of graphs that can be partitioned to satisfy all their vertices. Australas. J Comb. 29: 201-214 (2004) - Laura M. Harris, Johannes H. Hattingh:
The algorithmic complexity of certain functional variations of total domination in graphs. Australas. J Comb. 29: 143-156 (2004) - D. G. Hoffman, Charles C. Lindner:
A partial K4-e-design of order n can be embedded in a K4-e-design of order at most 8n+16√n+82. Australas. J Comb. 29: 225-230 (2004) - Zemin Jin, Xueliang Li:
On a conjecture on k-walks of graphs. Australas. J Comb. 29: 135-142 (2004) - Abdollah Khodkar, M. A. Shahabi, Seyed Mahmoud Sheikholeslami:
Families of 2-critical sets for dihedral groups. Australas. J Comb. 29: 173-186 (2004) - Sergey Kitaev:
The sigma-sequence and counting occurrences of some patterns, subsequences and subwords. Australas. J Comb. 29: 187-200 (2004) - Min Ho Lee:
Exterior derivatives and Laplacians on digraphs. Australas. J Comb. 29: 85-94 (2004) - Dingjun Lou, Qinglin Yu:
Sufficient conditions for n-matchable graphs. Australas. J Comb. 29: 127-134 (2004) - Dingjun Lou, Huiquan Zhu:
A note on max-leaves spanning tree problem in Halin graphs. Australas. J Comb. 29: 95-98 (2004) - Toufik Mansour:
Restricted 132-Dumont permutations. Australas. J Comb. 29: 103-118 (2004) - Atsuhiro Nakamoto:
Four-regular graphs that quadrangulate both the torus and the Klein bottle. Australas. J Comb. 29: 249-258 (2004) - K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and irredundance in tournaments. Australas. J Comb. 29: 157-172 (2004) - Kishore Sinha, Sanpei Kageyama, Ashish Das, G. M. Saha:
Some series of block designs with nested rows and columns. Australas. J Comb. 29: 337- (2004) - Christian Sloper:
An eccentric coloring of trees. Australas. J Comb. 29: 309-322 (2004) - Lutz Volkmann:
On the size of odd order graphs with no almost perfect matching. Australas. J Comb. 29: 119-126 (2004) - Stefan Winzen:
Strong subtournaments of close to regular multipartite tournaments. Australas. J Comb. 29: 49-58 (2004) - Danhong Zhang, Hong Wang:
A minimum degree result for disjoint cycles and forests in bipartite graphs. Australas. J Comb. 29: 35-48 (2004)
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-04-18 02:15 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