Остановите войну!
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 38 matches
- 1995
- Jürgen Bierbrauer:
A new family of 4-designs. Graphs Comb. 11(3): 209-211 (1995) - Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin:
The maximal number of inducedr-partite subgraphs. Graphs Comb. 11(1): 1-19 (1995) - Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
On clique convergent graphs. Graphs Comb. 11(3): 213-220 (1995) - Darryn E. Bryant, Peter Adams:
Decomposing the complete graph into cycles of many lengths. Graphs Comb. 11(2): 97-102 (1995) - Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - Laura M. Chihara, Dennis Stanton:
A matrix equation for association schemes. Graphs Comb. 11(2): 103-108 (1995) - Kiran B. Chilakamarri, Nathaniel Dean:
The Ulam number of infinite graphs. Graphs Comb. 11(2): 109-120 (1995) - Ralph J. Faudree, Jan van den Heuvel:
Degree sums, k-factors and hamilton cycles in graphs. Graphs Comb. 11(1): 21-28 (1995) - Hortensia Galeana-Sánchez, Sergio Rajsbaum:
Cycle-pancyclism in tournaments I. Graphs Comb. 11(3): 233-243 (1995) - B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd:
Right angle free subsets in the plane. Graphs Comb. 11(2): 121-129 (1995) - Luisa Gargano, János Körner, Ugo Vaccaro:
On the capacity of boolean graph formulæ. Graphs Comb. 11(1): 29-48 (1995) - Yubao Guo, Lutz Volkmann:
A generalization of menger's theorem for certain block - cactus graphs. Graphs Comb. 11(1): 49-52 (1995) - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Minimum order of loop networks of given degree and girth. Graphs Comb. 11(2): 131-138 (1995) - Penny E. Haxell:
A note on a conjecture of Gallai. Graphs Comb. 11(1): 53-57 (1995) - Penny E. Haxell:
A condition for matchability in hypergraphs. Graphs Comb. 11(3): 245-248 (1995) - Ryan B. Hayward:
Discs in unbreakable graphs. Graphs Comb. 11(3): 249-254 (1995) - George R. T. Hendry, Stephan Brandt:
An extremal problem for cycles in hamiltonian graphs. Graphs Comb. 11(3): 255-262 (1995) - Akira Hiraki, Hiroshi Suzuki, Masayuki Wajima:
On distance-regular graphs withki =kj, II. Graphs Comb. 11(4): 305-317 (1995) - E. Ihrig:
Graphs that admit square 1-factorizations are hamiltonian Cayley graphs. Graphs Comb. 11(4): 319-326 (1995) - Yoshiyasu Ishigami:
Containment problems in high-dimensional spaces. Graphs Comb. 11(4): 327-335 (1995) - Janice Jeffs, Suzanne M. Seager:
The chip firing game onn-cycles. Graphs Comb. 11(1): 59-67 (1995) - Leif K. Jørgensen:
Critical 3-cochromatic graphs. Graphs Comb. 11(3): 263-266 (1995) - Xin Liu:
Independent sets, cliques and hamiltonian graphs. Graphs Comb. 11(3): 267-273 (1995) - Rudolf Mathon, Anne Penfold Street:
Partitions of sets of two-fold triple systems, and their relation to some strongly regular graphs. Graphs Comb. 11(4): 347-366 (1995) - Hideaki Morita:
Cohen-Macaulay types of subgroup lattices of finite abelianp-groups. Graphs Comb. 11(3): 275-283 (1995) - Appu Muthusamy, P. Paulraja:
Factorizations of product graphs into cycles of uniform length. Graphs Comb. 11(1): 69-90 (1995) - Thomas Niessen:
Minimum degree, independence number and regular factors. Graphs Comb. 11(4): 367-378 (1995) - K. Nomura:
A remark on bipartite distance-regular graphs of even valency. Graphs Comb. 11(2): 139-140 (1995) - Haruko Okamura:
2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs. Graphs Comb. 11(2): 141-170 (1995) - Yee-Hock Peng:
Another family of chromatically unique graphs. Graphs Comb. 11(3): 285-291 (1995)
skipping 8 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-09-05 04: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