Остановите войну!
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 29 matches
- 1997
- Nawarat Ananchuen, Lou Caccetta:
Matching extension and minimum degree. Discret. Math. 170(1-3): 1-13 (1997) - Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani:
Nondecreasing Dyck paths and q-Fibonacci numbers. Discret. Math. 170(1-3): 211-217 (1997) - Frank E. Bennett, Ruizhong Wei:
The existence of Schröder designs with equal-sized holes. Discret. Math. 170(1-3): 15-28 (1997) - Mira Bernstein, Neil J. A. Sloane, Paul E. Wright:
On sublattices of the hexagonal lattice. Discret. Math. 170(1-3): 29-39 (1997) - Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz:
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170(1-3): 219-222 (1997) - Béla Bollobás, Alex D. Scott:
Independent sets and repeated degrees. Discret. Math. 170(1-3): 41-49 (1997) - Isma Bouchemakh, Konrad Engel:
The order-interval hypergraph of a finite poset and the König property. Discret. Math. 170(1-3): 51-61 (1997) - Gary Chartrand, Héctor Hevia, Elzbieta B. Jarrett, Michelle Schultz:
Subgraph distances in graphs defined by edge transfers. Discret. Math. 170(1-3): 63-79 (1997) - Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang:
Proper interval graphs and the guard problem. Discret. Math. 170(1-3): 223-230 (1997) - Guantao Chen, Richard H. Schelp, Warren E. Shreve:
A special k-coloring for a connected k-chromatic graph. Discret. Math. 170(1-3): 231-236 (1997) - Arkady A. Chernyak, Zhanna A. Chernyak:
r-Multihypergraphs with prescribed edge degree sequences. Discret. Math. 170(1-3): 237-240 (1997) - David Coulson:
An 18-colouring of 3-space omitting distance one. Discret. Math. 170(1-3): 241-247 (1997) - Davide Crippa, Klaus Simon:
q-distributions and Markov processes. Discret. Math. 170(1-3): 81-98 (1997) - Jitender S. Deogun, Dieter Kratsch, George Steiner:
1-Tough cocomparability graphs are hamiltonian. Discret. Math. 170(1-3): 99-106 (1997) - Kequan Ding:
Rook placements and cellular decomposition of partition varieties. Discret. Math. 170(1-3): 107-151 (1997) - Paul Erdös, László Pyber:
Covering a graph by complete bipartite graphs. Discret. Math. 170(1-3): 249-251 (1997) - Sylvain Gravier:
Hamiltonicity of the cross product of two Hamiltonian graphs. Discret. Math. 170(1-3): 253-257 (1997) - Michael Krivelevich:
Almost perfect matchings in random uniform hypergraphs. Discret. Math. 170(1-3): 259-263 (1997) - Yusheng Li, Cecil C. Rousseau:
On the Ramsey number r(H+K_n, Kn). Discret. Math. 170(1-3): 265-267 (1997) - Yusheng Li, Cecil C. Rousseau, Lubomír Soltés:
Ramsey linear families and generalized subdivided graphs. Discret. Math. 170(1-3): 269-275 (1997) - László Lipták:
Sperner systems containing at most k sets of every cardinality. Discret. Math. 170(1-3): 203-209 (1997) - Jiping Liu, Huishan Zhou:
Maximum induced matchings in graphs. Discret. Math. 170(1-3): 277-281 (1997) - Ali Ridha Mahjoub:
On perfectly two-edge connected graphs. Discret. Math. 170(1-3): 153-172 (1997) - Kevin McDougal:
A generalization of Ryser's theorem on term rank. Discret. Math. 170(1-3): 283-288 (1997) - William P. Miller:
Techniques in matroid reconstruction. Discret. Math. 170(1-3): 173-183 (1997) - Victor Neumann-Lara:
Vertex critical 4-dichromatic circulant tournaments. Discret. Math. 170(1-3): 289-291 (1997) - Hunter S. Snevily:
New families of graphs that have alpha-labelings. Discret. Math. 170(1-3): 185-194 (1997) - B. Wei:
Longest cycles in 3-connected graphs. Discret. Math. 170(1-3): 195-201 (1997) - Christina Zamfirescu:
Cyclic and cliquewise connectedness of line graphs. Discret. Math. 170(1-3): 293-297 (1997)
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-04-25 07:52 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