Остановите войну!
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 36 matches
- 1997
- Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
d-Cube decompositions ofKn/Km. Graphs Comb. 13(1): 1-7 (1997) - Martin Aigner, Anping Li:
Searching for counterfeit coins. Graphs Comb. 13(1): 9-20 (1997) - Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian:
Uniquely Total Colorable Graphs. Graphs Comb. 13(4): 305-314 (1997) - Gabriela Alexe, E. Olaru:
The Strongly Perfectness of Normal Product of t-Perfect Graphs. Graphs Comb. 13(3): 209-215 (1997) - Noga Alon, Michael Krivelevich:
Constructive Bounds for a Ramsey-Type Problem. Graphs Comb. 13(3): 217-225 (1997) - Richard P. Anstee, Jerrold R. Griggs, Attila Sali:
Small Forbidden Configurations. Graphs Comb. 13(2): 97-118 (1997) - David W. Barnette:
Cycle Covers of Planar 2-Edge-Connected Graphs. Graphs Comb. 13(4): 315-323 (1997) - Darryn E. Bryant:
2m-Cycle Systems of K 2m+1\C m. Graphs Comb. 13(3): 227-229 (1997) - Louis Caccetta, Rui-Zhong Jia:
Binary Labeling of Graphs. Graphs Comb. 13(2): 119-137 (1997) - Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp:
A Class of Edge Critical 4-Chromatic Graphs. Graphs Comb. 13(2): 139-146 (1997) - Guantao Chen, Michael S. Jacobson:
Degree Sum Conditions for Hamiltonicity on k-Partite Graphs. Graphs Comb. 13(4): 325-343 (1997) - Sheshayya A. Choudum, B. Ponnusamy:
Ordered and Canonical Ramsey Numbers of Stars. Graphs Comb. 13(2): 147-158 (1997) - Benjamin V. C. Collins:
The girth of a thin distance-regular graph. Graphs Comb. 13(1): 21-30 (1997) - Paul H. Edelman, Victor Reiner:
Catalan Triangulations of the Möbius Band. Graphs Comb. 13(3): 231-243 (1997) - Igor Fabrici, Stanislav Jendrol':
Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs. Graphs Comb. 13(3): 245-250 (1997) - Arthur M. Farley, Andrzej Proskurowski:
Minimum Self-Repairing Graphs. Graphs Comb. 13(4): 345-351 (1997) - Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto:
On the structure of bull-free perfect graphs. Graphs Comb. 13(1): 31-55 (1997) - Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments III. Graphs Comb. 13(1): 57-63 (1997) - Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa:
Orthogonal Double Covers of Complete Graphs by Trees. Graphs Comb. 13(3): 251-262 (1997) - Jerrold W. Grossman:
Spanning Star Trees in Regular Graphs. Graphs Comb. 13(4): 353-358 (1997) - Pavol Hell, Jing Huang:
Two remarks on circular arc graphs. Graphs Comb. 13(1): 65-72 (1997) - Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13(4): 359-367 (1997) - Jun Kyo Kim, Sang Geun Hahn:
Partitions of bipartite numbers. Graphs Comb. 13(1): 73-78 (1997) - Francisco Larrión, Victor Neumann-Lara:
A Family of Clique Divergent Graphs with Linear Growth. Graphs Comb. 13(3): 263-266 (1997) - Charles H. C. Little, Kee L. Teo, Hong Wang:
On a Conjecture on Directed Cycles in a Directed Bipartite Graph. Graphs Comb. 13(3): 267-273 (1997) - Tsuyoshi Nishimura:
A new recursive theorem onn-extendibility. Graphs Comb. 13(1): 79-83 (1997) - Colin Ramsay, Douglas G. Rogers:
The problem of irregular perfect systems of sets of iterated differences. Graphs Comb. 13(1): 85-94 (1997) - Eduardo Rivera-Campo:
A Note on Matchings and Spanning Trees with Bounded Degrees. Graphs Comb. 13(2): 159-165 (1997) - Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
On Planar Perfectly Contractile Graphs. Graphs Comb. 13(2): 167-187 (1997) - Antonio Sassano:
Chair-Free Berge Graphs Are Perfect. Graphs Comb. 13(4): 369-395 (1997)
skipping 6 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-08-24 12:37 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