Остановите войну!
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 33 matches
- 2003
- R. Julian R. Abel, Malcolm Greig, David H. Rees:
Existence of OBIBDs with k=4 with and without nesting. Discret. Math. 266(1-3): 3-36 (2003) - Saeed Akbari:
Two conjectures on uniquely totally colorable graphs. Discret. Math. 266(1-3): 41-45 (2003) - Priscila P. Alejandro, Rosemary A. Bailey, Peter J. Cameron:
Association schemes and permutation groups. Discret. Math. 266(1-3): 47-67 (2003) - Rosemary A. Bailey, Matthew A. Ollis, Donald A. Preece:
Round-dance neighbour designs from terraces. Discret. Math. 266(1-3): 69-86 (2003) - Halina Bielak:
Local Ramsey numbers for some graphs. Discret. Math. 266(1-3): 87-99 (2003) - Jens-P. Bode, Heiko Harborth, Martin Harborth:
King independence on triangle boards. Discret. Math. 266(1-3): 101-107 (2003) - Richard F. Booth, Maria Leonor Moreira, Maria Rosário Pinto:
A circuit axiomatisation of Lagrangian matroids. Discret. Math. 266(1-3): 109-118 (2003) - Alewyn P. Burger, Christina M. Mynhardt:
An improved upper bound for queens domination numbers. Discret. Math. 266(1-3): 119-131 (2003) - Peter J. Cameron:
Multi-letter Youden rectangles from quadratic forms. Discret. Math. 266(1-3): 143-151 (2003) - Peter J. Cameron:
Research problems from the 18th British Combinatorial Conference. Discret. Math. 266(1-3): 441-451 (2003) - Kathie Cameron, R. Sritharan, Yingwen Tang:
Finding a maximum induced matching in weakly chordal graphs. Discret. Math. 266(1-3): 133-142 (2003) - Sara Cauchie:
Full embeddings of (alpha, beta)-geometries in projective spaces - Part II. Discret. Math. 266(1-3): 153-183 (2003) - Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt:
Changing upper irredundance by edge addition. Discret. Math. 266(1-3): 185-193 (2003) - Peter Dankelmann, Henda C. Swart, David P. Day:
On strong distances in oriented graphs. Discret. Math. 266(1-3): 195-201 (2003) - Edward Dobson:
On isomorphisms of abelian Cayley objects of certain orders. Discret. Math. 266(1-3): 203-215 (2003) - Ales Drápal:
Near 2-groups yield an isomorphism with many fixed points. Discret. Math. 266(1-3): 217-228 (2003) - J. Keith Dugdale, Anthony J. W. Hilton:
The structure of totally critical graphs of odd order. Discret. Math. 266(1-3): 229-238 (2003) - Hacène Aït Haddadène, Meriem Mechebbek:
On the quasi-locally paw-free graphs. Discret. Math. 266(1-3): 37-40 (2003) - Michael A. Henning, Stephen T. Hedetniemi:
Defending the Roman Empire--A new strategy. Discret. Math. 266(1-3): 239-251 (2003) - Ray Hill, Chris P. Love:
On the (22, 4)-arcs in PG(2, 7) and related codes. Discret. Math. 266(1-3): 253-261 (2003) - Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
On two equimatchable graph classes. Discret. Math. 266(1-3): 263-274 (2003) - A. Donald Keedwell, Victor A. Shcherbacov:
Construction and properties of (r, s, t)-inverse quasigroups. I. Discret. Math. 266(1-3): 275-291 (2003) - Vladimir I. Levenshtein:
A universal bound for a covering in regular posets and its application to pool testing. Discret. Math. 266(1-3): 293-309 (2003) - Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena:
Every cubic cage is quasi 4-connected. Discret. Math. 266(1-3): 311-320 (2003) - Antoni Marczyk, Mariusz Wozniak:
Cycles in hamiltonian graphs of prescribed maximum degree. Discret. Math. 266(1-3): 321-326 (2003) - Alberto Márquez, Anna de Mier, Marc Noy, Maria Pastora Revuelta Marchena:
Locally grid graphs: classification and Tutte uniqueness. Discret. Math. 266(1-3): 327-352 (2003) - Nigel Martin:
Complete bipartite factorisations of Kn, n. Discret. Math. 266(1-3): 353-375 (2003) - Tatsuya Maruta:
Extendability of linear codes over GF(q) with minimum distance d, gcd(d, q)=1. Discret. Math. 266(1-3): 377-385 (2003) - Colin J. H. McDiarmid:
On the span in channel assignment problems: bounds, computing and counting. Discret. Math. 266(1-3): 387-397 (2003) - Matthew A. Ollis, Donald A. Preece:
Sectionable terraces and the (generalised) Oberwolfach problem. Discret. Math. 266(1-3): 399-416 (2003)
skipping 3 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-26 14:18 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