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 27 matches
- 2003
- René van den Brink, Robert P. Gilles:
Ranking by outdegree for directed graphs. Discret. Math. 271(1-3): 261-270 (2003) - Yaojun Chen, Feng Tian, Bing Wei:
Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta. Discret. Math. 271(1-3): 1-12 (2003) - Curtis Coker:
Enumerating a class of lattice paths. Discret. Math. 271(1-3): 13-28 (2003) - Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Jumping succession rules and their generating functions. Discret. Math. 271(1-3): 29-50 (2003) - Weidong Gao:
On zero-sum subsequences of restricted size II. Discret. Math. 271(1-3): 51-59 (2003) - Wayne Goddard, Michael Edwin Raines, Peter J. Slater:
Distance and connectivity measures in permutation graphs. Discret. Math. 271(1-3): 61-70 (2003) - Eline Govaert, Hendrik Van Maldeghem:
Forgetful polygons as generalizations of semi-affine planes. Discret. Math. 271(1-3): 71-100 (2003) - Michael A. Henning:
Defending the Roman Empire from multiple attacks. Discret. Math. 271(1-3): 101-115 (2003) - Yuanqiu Huang:
Maximum genus and chromatic number of graphs. Discret. Math. 271(1-3): 117-127 (2003) - Santosh N. Kabadi, Abraham P. Punnen:
Weighted graphs with all Hamiltonian cycles of the same length. Discret. Math. 271(1-3): 129-139 (2003) - Alexander K. Kelmans:
On graph closures. Discret. Math. 271(1-3): 141-168 (2003) - Joshua Von Korff:
Classification of greedy subset-sum-distinct-sequences. Discret. Math. 271(1-3): 271-282 (2003) - Pierre Lalonde:
Lattice paths and the antiautomorphism of the poset of descending plane partitions. Discret. Math. 271(1-3): 311-319 (2003) - Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
On a tree graph defined by a set of cycles. Discret. Math. 271(1-3): 303-310 (2003) - Wensong Lin:
Some star extremal circulant graphs. Discret. Math. 271(1-3): 169-177 (2003) - Martin Loebl, Jan Vondrák:
Towards a theory of frustrated degeneracy. Discret. Math. 271(1-3): 179-193 (2003) - Christian Mauduit, András Sárközy:
On the measures of pseudorandomness of binary sequences. Discret. Math. 271(1-3): 195-207 (2003) - Lianying Miao, Shiyou Pang, Jianliang Wu:
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. Discret. Math. 271(1-3): 321-325 (2003) - Joseph Samuel Myers:
The extremal function for unbalanced bipartite minors. Discret. Math. 271(1-3): 209-222 (2003) - Nedyalko Dimov Nenov:
On the triangle vertex Folkman numbers. Discret. Math. 271(1-3): 327-334 (2003) - Behnaz Omoomi, Yee-Hock Peng:
Chromatic equivalence classes of certain generalized polygon trees, III. Discret. Math. 271(1-3): 223-234 (2003) - Dieter Rautenbach:
A note on trees of maximum weight and restricted degrees. Discret. Math. 271(1-3): 335-342 (2003) - Gelasio Salazar:
Infinite families of crossing-critical graphs with given average degree. Discret. Math. 271(1-3): 343-350 (2003) - Milos Stojakovic:
Limit shape of optimal convex lattice polygons in the sense of different metrics. Discret. Math. 271(1-3): 235-249 (2003) - Zbigniew Switalski:
Half-integrality of vertices of the generalized transitive tournament polytope (n=6). Discret. Math. 271(1-3): 251-260 (2003) - Steve Wilson:
A worthy family of semisymmetric graphs. Discret. Math. 271(1-3): 283-294 (2003) - Dezheng Xie, Wanlian Yang:
The total chromatic number of graphs of even order and high degree. Discret. Math. 271(1-3): 295-302 (2003)
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-09-28 10:57 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