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 34 matches
- 2004
- Maria Axenovich, Tao Jiang:
Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb. 73 (2004) - Martin Baca, Stanislav Jendrol', Mirka Miller, Joseph F. Ryan:
Antimagic Labelings of Generalized Petersen Graphs That Are Plane. Ars Comb. 73 (2004) - G. K. Bennett, Mike J. Grannell, Terry S. Griggs:
Exponential lower bounds for the numbers of Skolem-type sequences. Ars Comb. 73 (2004) - Luis Boza, Eugenio M. Fedriani, Juan Núñez:
Obstruction Sets for Outer-Bananas-Surface Graphs. Ars Comb. 73 (2004) - Martín Cera, Ana Diánez, Pedro García-Vázquez, Juan Carlos Valenzuela:
Minor clique free extremal graphs. Ars Comb. 73 (2004) - Mustapha Chellali, Teresa W. Haynes:
Trees with Unique Minimum Paired-Dominating Sets. Ars Comb. 73 (2004) - Xue-Gang Chen, Liang Sun, Alice A. McRae:
Tree Domination in Graphs. Ars Comb. 73 (2004) - Sheshayya A. Choudum, M. A. Shalu:
Dissolved Graphs and Strong Perfect Graph Conjecture. Ars Comb. 73 (2004) - Peter Dankelmann, Neil J. Calkin:
The Domatic Number of Regular Graphs. Ars Comb. 73 (2004) - Changiz Eslahchi, Arash Rafiey:
Circular Chromatic Number of Hypergraphs. Ars Comb. 73 (2004) - Ziba Eslami, Gholamreza B. Khosrovshahi, Morteza Mohammad Noori, Behruz Tayfeh-Rezaie:
Some New 4-Designs. Ars Comb. 73 (2004) - Hui-Lan Fan, Hung-Lin Fu:
The Edge-Coloring of Graphs with Small Genus. Ars Comb. 73 (2004) - Miranca Fischermann:
Unique total domination graphs. Ars Comb. 73 (2004) - H. W. Gould:
Sums of powers of binomial coefficients via Legendre polynomials. Ars Comb. 73 (2004) - Peter V. Hegarty:
A variant of the discrete isoperimetric problem. Ars Comb. 73 (2004) - Michael A. Henning, Ortrud Oellermann:
Metric-Locating-Dominating Sets in Graphs. Ars Comb. 73 (2004) - Abdolhossein Hoorfar, Gholamreza B. Khosrovshahi:
On the existence of trades of large volumes. Ars Comb. 73 (2004) - K. M. Kathiresan, R. Ganesan:
A Labeling Problem on the Plane Graphs Pa, b. Ars Comb. 73 (2004) - Xiangwen Li, Bing Wei, Fan Yang:
Independent Cycles in a Bipartite Graph. Ars Comb. 73 (2004) - Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Outerplanar Graphs. Ars Comb. 73 (2004) - Chester W. J. Liu, Peter R. Wild:
Embeddings of Steiner Quadruple Systems using Extensions of Linear Spaces. Ars Comb. 73 (2004) - Hamid Reza Maimani, Rouzbeh Torabi:
An Algorithm for Constructing two disjoint Hadamard Designs. Ars Comb. 73 (2004) - Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski:
Ramsey Numbers for Triangles versus Almost-Complete Graphs. Ars Comb. 73 (2004) - Terry A. McKee:
Graph Orientations and Signings That Are Saturated with Alternating Cycles. Ars Comb. 73 (2004) - Peter Rowley:
Plane-Line Collinearity Graph of the M24 Minimal Parabolic Geometry. Ars Comb. 73 (2004) - Aristidis Sapounakis, Panagiotis Tsikouras:
On the enumeration of noncrossing partitions with fixed points. Ars Comb. 73 (2004) - Subrata Kumar Satpati, Rajender Parsad:
Construction and Cataloguing of Nested Partially Balanced Incomplete Block Designs. Ars Comb. 73 (2004) - Kazuhiro Suzuki:
A Counterexample to a Conjecture on Packing Two Copies of a Tree into its Third Power. Ars Comb. 73 (2004) - Stefan Szeider:
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. Ars Comb. 73 (2004) - László A. Székely:
Counting rooted spanning forests in complete multipartite graphs. Ars Comb. 73 (2004)
skipping 4 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-10-06 01:11 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