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
- 1999
- Asad Ali Ali, William Staton:
The Extremal Question for Cycles with Chords. Ars Comb. 51 (1999) - Anjing Qu:
On Complementary Consecutive Labelings of Octahedron. Ars Comb. 51 (1999) - Iliya Bluskov:
New Simple 3-Designs on 26 and 28 Points. Ars Comb. 51 (1999) - Hajo Broersma, Cornelis Hoede:
Another equivalent of the graceful tree conjecture. Ars Comb. 51 (1999) - Yoshimi Egawa, Katsumi Inoue:
Radius of (2k-1)-Connected Graphs. Ars Comb. 51 (1999) - T. Gangopadhyay:
Some Results on Packing Graphs in their Complements. Ars Comb. 51 (1999) - F. Göbel, Cornelis Hoede:
Magic Labelings of Graphs. Ars Comb. 51 (1999) - John L. Goldwasser, Cun-Quan Zhang:
Permutation graphs and Petersen graph. Ars Comb. 51 (1999) - Noboru Hamada:
The Nonexistence of Quaternary Linear Codes With Parameters [243, 5, 181], [248, 5, 185] and [240, 5, 179]. Ars Comb. 51 (1999) - Keiichi Handa:
Bipartitie Graphs with Balanced (a, b)-Partitions. Ars Comb. 51 (1999) - Cornelis Hoede:
A Comparison of Some Conditions for Non-Hamiltonicity of Graphs. Ars Comb. 51 (1999) - Bu Yue Hua, Zhang Ke Min:
Completely Strong Path-Connectivity of Local Tournaments. Ars Comb. 51 (1999) - Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decomposition of Multigraphs into Isomorphic Graphs with Two Edges. Ars Comb. 51 (1999) - A. Donald Keedwell:
What is the size of the smallest latin square for which a weakly completable critical set of cells exists? Ars Comb. 51 (1999) - G. Ram Kherwa, Jagdish Prasad, Bhagwandas:
Balanced Ternary Designs from any (v, b, r, k) Design. Ars Comb. 51 (1999) - Gholamreza B. Khosrovshahi, Rouzbeh Torabi:
Maximal Trades. Ars Comb. 51 (1999) - Suh-Ryung Kim:
On the Inequality dk(G) <= k(G) + 1. Ars Comb. 51 (1999) - William Klostermeyer:
Pushing Vertices and Orienting Edges. Ars Comb. 51 (1999) - Cai Heng Li:
Finite Abelian Groups with the m-DCI Property. Ars Comb. 51 (1999) - Rao Li:
A Note on Hamiltonian Cycles in K(1, r)-Free Graphs. Ars Comb. 51 (1999) - Bolian Liu:
Generalized Exponents of Primitive, Nearly Reducible Matrices. Ars Comb. 51 (1999) - Mohammad Mahdian, Ebadollah S. Mahmoodian:
A Characterization of Uniquely 2-List Colorable Graphs. Ars Comb. 51 (1999) - Terry A. McKee:
An Inequality Characterizing Chordal Graphs. Ars Comb. 51 (1999) - Amram Meir, John W. Moon:
On the Bipartition Numbers of Random Trees, II. Ars Comb. 51 (1999) - Klaus Metsch, Bridget S. Webb:
A Note on the Cycle Structures of Automorphisms of 2-(v, k, 1) Designs. Ars Comb. 51 (1999) - Stewart W. Neufeld:
The Concept of Diameter in Exponents of Symmetric Primitive Graphs. Ars Comb. 51 (1999) - David A. Pike:
Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems. Ars Comb. 51 (1999) - Donald A. Preece, B. J. Vowden, Nicholas C. K. Phillips:
Double Youden rectangles of sizes p(2p+1) and (p+1)(2p+1). Ars Comb. 51 (1999) - B. J. Vowden, Donald A. Preece:
Some New Infinite Series of Freeman-Youden Rectangles. Ars Comb. 51 (1999) - Yanxun Chang, Gennian Ge:
Some new large sets of KTS(v). Ars Comb. 51 (1999)
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-02 15:10 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