Остановите войну!
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 90 matches
- 2000
- Méziane Aïder, Sylvain Gravier:
Critical graphs for clique-coloring. Electron. Notes Discret. Math. 5: 3-6 (2000) - Kiyoshi Ando:
Contractible edges in a k-connected graph (K1 + P4)-free graph. Electron. Notes Discret. Math. 5: 7-10 (2000) - Krystyna T. Balinska, Louis V. Quintas:
Results and Problems Concerning Edge Transformed Graphs. Electron. Notes Discret. Math. 5: 11-14 (2000) - Jørgen Bang-Jensen:
Problems concerning global connectivity of directed graphs. Electron. Notes Discret. Math. 5: 15-18 (2000) - Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of graphs and the triangle free subgraph polytope. Electron. Notes Discret. Math. 5: 19-22 (2000) - Halina Bielak:
Local Ramsey Numbers for Copies of Cycles. Electron. Notes Discret. Math. 5: 23-26 (2000) - Hans L. Bodlaender:
The algorithmic theory of treewidth. Electron. Notes Discret. Math. 5: 27-30 (2000) - Anthony Bonato, Kathie Cameron:
On 2-e.c. graphs, tournaments, and hypergraphs. Electron. Notes Discret. Math. 5: 31-34 (2000) - Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
Orthogonal Drawings Based On The Stratification Of Planar Graphs. Electron. Notes Discret. Math. 5: 35-37 (2000) - Gabriela Hauser Bordalo, Bernard Monjardet:
The lattice of strict completions of a poset. Electron. Notes Discret. Math. 5: 38-41 (2000) - Bostjan Bresar:
On subgraphs of Cartesian product graphs and S-primeness. Electron. Notes Discret. Math. 5: 42-45 (2000) - Richard C. Brewster, Pavol Hell:
On homomorphisms to edge-coloured cycles. Electron. Notes Discret. Math. 5: 46-49 (2000) - Kathie Cameron:
Induced Matchings in Intersection Graphs. Electron. Notes Discret. Math. 5: 50-52 (2000) - Roberto Canogar:
Partition Designs with two subsets of the Hamming Space. Electron. Notes Discret. Math. 5: 53-55 (2000) - Nathalie Caspard, Claude Le Conte de Poly-Barbut, Roberto Mantaci, Michel Morvan:
Cayley lattices of finite Coxeter groups are bounded. Electron. Notes Discret. Math. 5: 56-59 (2000) - Irène Charon, Olivier Hudry:
Slater orders and Hamiltonian paths of tournaments. Electron. Notes Discret. Math. 5: 60-63 (2000) - Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
On i-minus-Edge-Removal-critical graphs. Electron. Notes Discret. Math. 5: 64-66 (2000) - Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
A hypergraph approach to digital fingerprinting. Electron. Notes Discret. Math. 5: 67-70 (2000) - Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). Electron. Notes Discret. Math. 5: 71-74 (2000) - Bruno Courcelle:
Clique-width of countable graphs: a compactness property. Electron. Notes Discret. Math. 5: 75-76 (2000) - Henry Crapo, Claude Le Conte de Poly-Barbut:
Coxeter groups through the looking glass: Mirrors and Convexity. Electron. Notes Discret. Math. 5: 77-80 (2000) - Rita Csákány:
Some Results on the Sandglass Conjecture. Electron. Notes Discret. Math. 5: 81-84 (2000) - Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Some results on graph parameters in weighted graphs. Electron. Notes Discret. Math. 5: 85-88 (2000) - Charles Delorme:
Laplacian Eigenvalues and multisections. Electron. Notes Discret. Math. 5: 93-96 (2000) - Vladimir Dobrynin:
On rank of a matrix associated with graph. Electron. Notes Discret. Math. 5: 100-103 (2000) - Damanpal Singh Dogra, Dominique Fortin:
Simultaneous Disjoint Routing in Regular Graphs. Electron. Notes Discret. Math. 5: 104-107 (2000) - Reinhardt Euler:
Coloring Planar Toeplitz Graphs. Electron. Notes Discret. Math. 5: 108-111 (2000) - Guillaume Fertin, André Raspaud:
Recognizing Recursive Circulant Graphs (Extended Abstract). Electron. Notes Discret. Math. 5: 112-115 (2000) - Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Electron. Notes Discret. Math. 5: 89-92 (2000) - Gasper Fijavz:
K6 and icosahedron minors in 5-connected projective planar graphs. Electron. Notes Discret. Math. 5: 116-119 (2000)
skipping 60 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-05-28 20:47 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