Остановите войну!
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 30 matches
- 2010
- S. Arumugam, Odile Favaron, S. Sudha:
Irredundance saturation number of a graph. Australas. J Comb. 46: 37-50 (2010) - Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder:
The plurality strategy on graphs. Australas. J Comb. 46: 191-202 (2010) - Ryan Bauer, Hong Wang:
Disjoint triangles and pentagons in a graph. Australas. J Comb. 46: 79-90 (2010) - Y. M. Borse:
Forbidden-minors for splitting binary gammoids. Australas. J Comb. 46: 307-314 (2010) - Shuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto:
A 2-factor in which each cycle contains a vertex in a specified stable set. Australas. J Comb. 46: 203-210 (2010) - Italo J. Dejter:
Corrigendum to: On a {K4, K2, 2, 2}-ultrahomogeneous graph. Australas. J Comb. 46: 315- (2010) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Ramsey numbers in rainbow triangle free colorings. Australas. J Comb. 46: 269-284 (2010) - Michael Fraboni, Nathan Shank:
Maximum graphs with unique minimum dominating set of size two. Australas. J Comb. 46: 91-100 (2010) - Allan Frendrup, Bert L. Hartnell, Preben D. Vestergaard:
A note on equimatchable graphs. Australas. J Comb. 46: 185-190 (2010) - Hong-Yong Fu, Dezheng Xie:
Equitable L(2, 1)-labelings of Sierpiński graphs. Australas. J Comb. 46: 147-156 (2010) - Ian D. Gray, Jim A. MacDougall:
Vertex-magic labeling of non-regular graphs. Australas. J Comb. 46: 173-184 (2010) - Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. 46: 217-232 (2010) - Pak Tung Ho:
On Ramsey unsaturated and saturated graphs. Australas. J Comb. 46: 13-18 (2010) - Moharram N. Iradmusa:
A note on partial list coloring. Australas. J Comb. 46: 19-24 (2010) - Abdollah Khodkar, Sam Nolen, James T. Perconti:
Super edge-graceful labelings of complete bipartite graphs. Australas. J Comb. 46: 241-262 (2010) - Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong:
Lower bound on the weakly connected domination number of a cycle-disjoint graph. Australas. J Comb. 46: 157-166 (2010) - Ilias S. Kotsireas, Christos Koukouvinos, Jennifer Seberry, Dimitris E. Simos:
New classes of orthogonal designs constructed from complementary sequences with given spread. Australas. J Comb. 46: 67-78 (2010) - Dorota Kuziak:
Interpolation properties of domination parameters of a graph. Australas. J Comb. 46: 3-12 (2010) - You Lu, Jun-Ming Xu:
Bipanconnectivity of Cartesian product networks. Australas. J Comb. 46: 297-306 (2010) - Xiuwen Ma, Zihong Tian:
On α-resolvable directed cycle systems for cycle length 4. Australas. J Comb. 46: 263-268 (2010) - Tiziana Masini:
A combinatorial characterization of the Hermitian surface. Australas. J Comb. 46: 101-108 (2010) - Salvatore Milici, Giorgio Ragusa:
Maximum embedding of an H(v-w, 3, 1) into a TS(v, λ). Australas. J Comb. 46: 121-128 (2010) - Doost Ali Mojdeh, P. Firoozi, Roslan Hasni:
On connected (γ, k)-critical graphs. Australas. J Comb. 46: 25-36 (2010) - Pawel Pralat:
When does a random graph have constant cop number? Australas. J Comb. 46: 285-296 (2010) - Suk Jai Seo, Peter J. Slater:
Open neighborhood locating dominating sets. Australas. J Comb. 46: 109-120 (2010) - B. Sharada, Nandappa D. Soner:
On the domination subdivision numbers of trees. Australas. J Comb. 46: 233-240 (2010) - Jamie Simpson:
Modified Padovan words and the maximum number of runs in a word. Australas. J Comb. 46: 129-146 (2010) - Renwang Su:
Existence of (K4-e)-GDDs of type 2n. Australas. J Comb. 46: 167-172 (2010) - J. Wang, L. Yin:
A class of group divisible designs with block size three and index λ. Australas. J Comb. 46: 51-66 (2010) - Andrzej Wloch, Iwona Wloch:
Generalized Pell numbers, graph representations and independent sets. Australas. J Comb. 46: 211-216 (2010)
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-05-14 07:24 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