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 31 matches
- 1999
- Bostjan Bresar:
On clique-gated graphs. Discret. Math. 199(1-3): 201-205 (1999) - Ruth A. Britto-Pacumio:
Limits of iteratd H-line graphs. Discret. Math. 199(1-3): 1-10 (1999) - Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley:
Characterizations of bipartite Steinhaus graphs. Discret. Math. 199(1-3): 11-25 (1999) - Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced cycles and holes in bipartite graphs. Discret. Math. 199(1-3): 27-33 (1999) - Rita Csákány, János Komlós:
The smallest Ramsey numbers. Discret. Math. 199(1-3): 193-199 (1999) - Mike Daven, C. A. Rodger:
(k, g)-cages are 3-connected. Discret. Math. 199(1-3): 207-215 (1999) - Andrej Dujella:
A bijective proof of Riordan's theorem on powers of Fibonacci numbers. Discret. Math. 199(1-3): 217-220 (1999) - Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in graphs. Discret. Math. 199(1-3): 35-47 (1999) - Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
On perfect neighborhood sets in graphs. Discret. Math. 199(1-3): 221-225 (1999) - Harald Fripertinger:
Enumeration of mosaics. Discret. Math. 199(1-3): 49-60 (1999) - Wayne Goddard, Michael A. Henning:
Real and integer domination in graphs. Discret. Math. 199(1-3): 61-75 (1999) - David J. Grabiner:
Posets in which every interval is a product of chains, and natural local actions of the symmetric group. Discret. Math. 199(1-3): 77-84 (1999) - Gary Haggard, Thomas R. Mathies:
The computation of chromatic polynomials. Discret. Math. 199(1-3): 227-231 (1999) - Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker:
A characterization of uniquely vertex colorable graphs using minimal defining sets. Discret. Math. 199(1-3): 233-236 (1999) - Han Ren:
Another cycle structure theorem for hamiltonian graphs. Discret. Math. 199(1-3): 237-243 (1999) - Michael D. Hirschhorn, James A. Sellers:
On representations of a number as a sum of three squares. Discret. Math. 199(1-3): 85-101 (1999) - Andreas Huck:
Independent branchings in acyclic diagraphs. Discret. Math. 199(1-3): 245-249 (1999) - Alexander K. Kelmans, Xuerong Yong:
On the distribution of eigenvalues of graphs. Discret. Math. 199(1-3): 251-258 (1999) - Péter Komjáth:
Some remarks on universal graphs. Discret. Math. 199(1-3): 259-265 (1999) - Jacques Mazoyer, Ivan Rapaport:
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. Discret. Math. 199(1-3): 103-122 (1999) - Colin McDiarmid, Bruce A. Reed:
Colouring proximity graphs in the plane. Discret. Math. 199(1-3): 123-137 (1999) - Michel Minoux:
A generalization of the all minors tree theorem to semirings. Discret. Math. 199(1-3): 139-150 (1999) - J. Schmid:
On maximal sublattices of finite lattices. Discret. Math. 199(1-3): 151-159 (1999) - Andreas E. Schroth:
How to draw a hexagon. Discret. Math. 199(1-3): 161-171 (1999) - Miroslav Treml:
Some partitions of positive integers. Discret. Math. 199(1-3): 267-271 (1999) - Kazuhiko Ushio:
Cycle-factorization of symmetric complete multipartite digraphs. Discret. Math. 199(1-3): 273-278 (1999) - Lutz Volkmann:
Longest paths in semicomplete multipartite digraphs. Discret. Math. 199(1-3): 279-284 (1999) - Piotr Wójcik:
Union-closed families of sets. Discret. Math. 199(1-3): 173-182 (1999) - Baogen Xu, Zhongfu Zhang:
On mixed Ramsey numbers. Discret. Math. 199(1-3): 285-289 (1999) - Wenan Zang:
Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. Discret. Math. 199(1-3): 183-192 (1999)
skipping 1 more match
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-19 10:25 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