![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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
- 1991
- Noga Alon, András Hajnal:
Ramsey graphs contain many distinct induced subgraphs. Graphs Comb. 7(1): 1-6 (1991) - Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer:
Set systems with no union of cardinality 0 modulom. Graphs Comb. 7(2): 97-99 (1991) - Denise Amar, Irène Fournier, Anne Germa:
Pancyclism in Chvátal-Erdös's graphs. Graphs Comb. 7(2): 101-112 (1991) - K. T. Arasu, Dieter Jungnickel, Alexander Pott:
The mann test for divisible difference sets. Graphs Comb. 7(3): 209-217 (1991) - Béla Bajnok:
Construction of spherical 4- and 5-designs. Graphs Comb. 7(3): 219-233 (1991) - Curtiss Barefoot, Frank Harary, Kathryn Fraughnaugh Jones:
What is the difference between the domination and independent domination numbers of a cubic graph? Graphs Comb. 7(2): 205-208 (1991) - Jürgen Bierbrauer:
Weighted arcs, the finite radon transform and a Ramsey problem. Graphs Comb. 7(2): 113-118 (1991) - John van Bon
:
On distance-transitive graphs and involutions. Graphs Comb. 7(4): 377-394 (1991) - André Bouchet:
Tutte-martin polynomials and orienting vectors of isotropic systems. Graphs Comb. 7(3): 235-252 (1991) - Neal Brand:
Polynomial isomorphisms of combinatorial objects. Graphs Comb. 7(1): 7-14 (1991) - Gerard J. Chang
:
Centers of chordal graphs. Graphs Comb. 7(4): 305-313 (1991) - Gary Chartrand, S. F. Kapoor, Terry A. McKee, Farrokh Saba:
Edge-clique graphs. Graphs Comb. 7(3): 253-264 (1991) - Ronald D. Dutton, Robert C. Brigham:
Edges in graphs with large girth. Graphs Comb. 7(4): 315-321 (1991) - Yoshimi Egawa:
Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]. Graphs Comb. 7(1): 15-21 (1991) - Geoffrey Exoo:
A bipartite Ramsey number. Graphs Comb. 7(4): 395-396 (1991) - Jean-Luc Fouquet, Henri Thuillier:
Non removable edges in 3-connected cubic graphs. Graphs Comb. 7(2): 119-141 (1991) - Peter Frankl:
Shadows and shifting. Graphs Comb. 7(1): 23-29 (1991) - Ervin Györi, János Pach, Miklós Simonovits:
On the maximal number of certain subgraphs inKr-free graphs. Graphs Comb. 7(1): 31-37 (1991) - Yahya Ould Hamidoune, Anna S. Lladó
, Oriol Serra
:
Vosperian and superconnected Abelian Cayley digraphs. Graphs Comb. 7(2): 143-152 (1991) - Julie Haviland, Andrew Thomason:
Rotation numbers for complete tripartite graphs. Graphs Comb. 7(2): 153-163 (1991) - Andreas Huck:
A sufficient condition for graphs to be weaklyk-linked. Graphs Comb. 7(4): 323-351 (1991) - Tadashi Iida, Tsuyoshi Nishimura:
An ore-type condition for the existence ofk-factors in graphs. Graphs Comb. 7(4): 353-361 (1991) - Ilia Krasikov:
Interchanging branches and similarity in a tree. Graphs Comb. 7(2): 165-175 (1991) - Wing Man Kwok:
Character table of a controlling association scheme defined by the general orthogonal groupO(3, q). Graphs Comb. 7(1): 39-52 (1991) - Stephen C. Locke
, Cun-Quan Zhang:
Cycles through three vertices in 2-connected graphs. Graphs Comb. 7(3): 265-269 (1991) - Fred R. McMorris, Edward R. Scheinerman:
Connectivity threshold for random chordal graphs. Graphs Comb. 7(2): 177-181 (1991) - Bojan Mohar:
Eigenvalues, diameter, and mean distance in graphs. Graphs Comb. 7(1): 53-64 (1991) - Luz R. Nochefranca:
On an infinite class of non-bipartite and non-cayley graphs having 2-arc transitive automorphism groups. Graphs Comb. 7(3): 271-275 (1991) - Ryuzaburo Noda:
An inequality for steiner systems. Graphs Comb. 7(3): 277-278 (1991) - Mark Ramras:
Symmetric edge-decompositions of hypercubes. Graphs Comb. 7(1): 65-87 (1991)
skipping 6 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-30 21:28 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