Остановите войну!
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 45 matches
- 2002
- Dan Archdeacon, Feliu Sagols:
Nesting points in the sphere. Discret. Math. 244(1-3): 5-16 (2002) - Bostjan Bresar:
The direct expansion of graphs. Discret. Math. 244(1-3): 17-30 (2002) - Richard C. Brewster, Pavol Hell:
Homomorphisms to powers of digraphs. Discret. Math. 244(1-3): 31-41 (2002) - Michel Deza, Mikhail Shtogrin:
Isometric embedding of mosaics into cubic lattices. Discret. Math. 244(1-3): 43-53 (2002) - Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto:
Choice number of some complete multi-partite graphs. Discret. Math. 244(1-3): 55-66 (2002) - Xin Gui Fang, Cai Heng Li, Jie Wang, Ming Yao Xu:
On cubic Cayley graphs of finite simple groups. Discret. Math. 244(1-3): 67-75 (2002) - Herbert Fleischner:
Bipartizing matchings and Sabidussi's compatibility conjecture. Discret. Math. 244(1-3): 77-82 (2002) - Amauri Gutiérrez, Anna S. Lladó:
Regular packings of regular graphs. Discret. Math. 244(1-3): 83-94 (2002) - Heiko Harborth:
Special numbers of crossings for complete graphs. Discret. Math. 244(1-3): 95-102 (2002) - Frédéric Havet, Janez Zerovnik:
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discret. Math. 244(1-3): 103-108 (2002) - Mitsugu Hirasaka, Mikhail E. Muzychuk:
Association schemes generated by a non-symmetric relation of valency 2. Discret. Math. 244(1-3): 109-135 (2002) - Milan Hladnik, Dragan Marusic, Tomaz Pisanski:
Cyclic Haar graphs. Discret. Math. 244(1-3): 137-152 (2002) - Katharina T. Huber, Vincent Moulton:
The relation graph. Discret. Math. 244(1-3): 153-166 (2002) - Robert Jajcay, Jozef Sirán:
Skew-morphisms of regular Cayley maps. Discret. Math. 244(1-3): 167-179 (2002) - Aleksandar Jurisic, Jacobus H. Koolen:
Krein parameters and antipodal tight graphs with diameter 3 and 4. Discret. Math. 244(1-3): 181-202 (2002) - R. B. King:
Novel highly symmetrical trivalent graphs which lead to negative curvature carbon and boron nitride chemical structures. Discret. Math. 244(1-3): 203-210 (2002) - Shigeru Kitakubo, Seiya Negami:
Re-embedding structures of 5-connected projective-planar graphs. Discret. Math. 244(1-3): 211-221 (2002) - Sandi Klavzar, Alenka Lipovec, Marko Petkovsek:
On subgraphs of Cartesian product graphs. Discret. Math. 244(1-3): 223-230 (2002) - Sandi Klavzar, Dragan Marusic, Bojan Mohar:
Preface. Discret. Math. 244(1-3): 1-4 (2002) - Mohamed Kobeissi, Michel Mollard:
Spanning graphs of hypercubes: starlike and double starlike trees. Discret. Math. 244(1-3): 231-239 (2002) - Andrei Kotlov:
Matchings and Hadwiger's Conjecture. Discret. Math. 244(1-3): 241-252 (2002) - Ondrej Kovárík, Milos Mulac, Zdenek Ryjácek:
A note on degree conditions for hamiltonicity in 2-connected claw-free graphs. Discret. Math. 244(1-3): 253-268 (2002) - Charles Curtis Lindner, Lorenzo Milazzo:
Embedding partial bipartite directed cycle systems. Discret. Math. 244(1-3): 269-278 (2002) - Charles H. C. Little, Franz Rendl, Ilse Fischer:
Towards a characterisation of Pfaffian near bipartite graphs. Discret. Math. 244(1-3): 279-297 (2002) - Aleksander Malnic:
Action graphs and coverings. Discret. Math. 244(1-3): 299-322 (2002) - Joze Marincek, Bojan Mohar:
On approximating the maximum diameter ratio of graphs. Discret. Math. 244(1-3): 323-330 (2002) - Dragan Marusic, Primoz Potocnik:
Classifying 2-arc-transitive graphs of order a product of two primes. Discret. Math. 244(1-3): 331-338 (2002) - Bojan Mohar:
Coloring Eulerian triangulations of the projective plane. Discret. Math. 244(1-3): 339-343 (2002) - Atsuhiro Nakamoto, Seiya Negami:
Generating triangulations on closed surfaces with minimum degree at least 4. Discret. Math. 244(1-3): 345-349 (2002) - Louis Petingi, José Rodríguez:
A new technique for the characterization of graphs with a maximum number of spanning trees. Discret. Math. 244(1-3): 351-373 (2002)
skipping 15 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-07-03 02: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