Остановите войну!
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 27 matches
- 2003
- Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees: cases 0 and 1 mod 12. Discuss. Math. Graph Theory 23(1): 177-187 (2003) - Martin Baca, François Bertault, James Arthur MacDougall, Mirka Miller, Rinovia Simanjuntak, Slamin:
Vertex-antimagic total labelings of graphs. Discuss. Math. Graph Theory 23(1): 67-83 (2003) - Claude Benzaken, Sylvain Gravier, Riste Skrekovski:
Hajós' theorem for list colorings of hypergraphs. Discuss. Math. Graph Theory 23(2): 207-213 (2003) - Stefan Berezný, Vladimír Lacko:
Balanced problems on graphs with categorization of edges. Discuss. Math. Graph Theory 23(1): 5-21 (2003) - Amelie J. Berger, Peter Mihók:
Prime ideals in the lattice of additive induced-hereditary graph properties. Discuss. Math. Graph Theory 23(1): 117-127 (2003) - Bostjan Bresar:
Arboreal structure and regular graphs of median-like classes. Discuss. Math. Graph Theory 23(2): 215-225 (2003) - Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Tree-like isometric subgraphs of hypercubes. Discuss. Math. Graph Theory 23(2): 227-240 (2003) - Yair Caro, Michael S. Jacobson:
On non-z(mod k) dominating sets. Discuss. Math. Graph Theory 23(1): 189-199 (2003) - Ralph J. Faudree, Annette Schelten, Ingo Schiermeyer:
The Ramsey number r(C7, C7, C7). Discuss. Math. Graph Theory 23(1): 141-158 (2003) - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
Labeling the vertex amalgamation of graphs. Discuss. Math. Graph Theory 23(1): 129-139 (2003) - Christian Germain, Hamamache Kheddouci:
On the packing of two copies of a caterpillar in its third power. Discuss. Math. Graph Theory 23(1): 105-115 (2003) - Petra M. Gleiss, Josef Leydold, Peter F. Stadler:
Circuit bases of strongly connected digraphs. Discuss. Math. Graph Theory 23(2): 241-260 (2003) - Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
On cyclically embeddable (n, n)-graphs. Discuss. Math. Graph Theory 23(1): 85-104 (2003) - Bert L. Hartnell, Douglas F. Rall:
Improving some bounds for dominating Cartesian products. Discuss. Math. Graph Theory 23(2): 261-272 (2003) - Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003) - Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis:
On constant-weight TSP-tours. Discuss. Math. Graph Theory 23(2): 287-307 (2003) - Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik:
Preface. Discuss. Math. Graph Theory 23(2): 205 (2003) - Henry Martyn Mulder, Ladislav Nebesky:
Modular and median signpost systems and their underlying graphs. Discuss. Math. Graph Theory 23(2): 309-324 (2003) - Christina M. Mynhardt:
Upper bounds for the domination numbers of toroidal queens graphs. Discuss. Math. Graph Theory 23(1): 163-175 (2003) - Jaroslav Nesetril, Claude Tardif:
On maximal finite antichains in the homomorphism order of directed graphs. Discuss. Math. Graph Theory 23(2): 325-332 (2003) - Beata Orchel:
2-placement of (p, q)-trees. Discuss. Math. Graph Theory 23(1): 23-36 (2003) - Michael D. Plummer, Michael Stiebitz, Bjarne Toft:
On a special case of Hadwiger's conjecture. Discuss. Math. Graph Theory 23(2): 333-363 (2003) - Norbert Polat:
On dually compact closed classes of graphs and BFS-constructible graphs. Discuss. Math. Graph Theory 23(2): 365-381 (2003) - Martin Sonntag:
Difference labelling of cacti. Discuss. Math. Graph Theory 23(1): 55-65 (2003) - Vladimir Ivanovich Trofimov:
Undirected and directed graphs with near polynomial growth. Discuss. Math. Graph Theory 23(2): 383-391 (2003) - Damir Vukicevic:
Decomposition of complete graphs into factors of diameter two and three. Discuss. Math. Graph Theory 23(1): 37-54 (2003) - Igor E. Zverovich:
Perfect connected-dominant graphs. Discuss. Math. Graph Theory 23(1): 159-162 (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-05-20 10:15 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