![](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 30 matches
- 1987
- Kiyoshi Ando, Hikoe Enomoto, Akira Saito:
Contractible edges in 3-connected graphs. J. Comb. Theory B 42(1): 87-93 (1987) - David W. Barnette:
5-connected 3-polytopes are refinements of octahedra. J. Comb. Theory B 42(2): 250-254 (1987) - Abdelhamid Benhocine, A. Pawel Wojda:
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs. J. Comb. Theory B 42(2): 167-180 (1987) - Kenneth A. Berman:
Balanced vertex weightings and arborescences. J. Comb. Theory B 42(3): 274-301 (1987) - Bor-Liang Chen, Ko-Wei Lih:
Hamiltonian uniform subset graphs. J. Comb. Theory B 42(3): 257-263 (1987) - Ying Cheng, James G. Oxley:
On weakly symmetric graphs of order twice a prime. J. Comb. Theory B 42(2): 196-211 (1987) - Reinhard Diestel:
Simplicial decompositions of graphs - Some uniqueness results. J. Comb. Theory B 42(2): 133-145 (1987) - John Donald, John Elwin, Richard Hager, Peter Salamon:
Handle bases and bounds on the number of subgraphs. J. Comb. Theory B 42(1): 1-13 (1987) - Yoshimi Egawa:
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph. J. Comb. Theory B 42(3): 371-377 (1987) - Herbert Fleischner, Bill Jackson:
Compatible path-cycle-decompositions of plane graphs. J. Comb. Theory B 42(1): 94-121 (1987) - Alan M. Frieze
, Bill Jackson:
Large induced trees in sparse random graphs. J. Comb. Theory B 42(2): 181-195 (1987) - Chính T. Hoàng:
Alternating orientation and alternating colouration of perfect graphs. J. Comb. Theory B 42(3): 264-273 (1987) - Chính T. Hoàng:
On a conjecture of Meyniel. J. Comb. Theory B 42(3): 302-312 (1987) - William L. Kocay:
A family of nonreconstructible hypergraphs. J. Comb. Theory B 42(1): 46-63 (1987) - Rudolf Mathon:
Lower bounds for Ramsey numbers and association schemes. J. Comb. Theory B 42(1): 122-127 (1987) - Terry A. McKee:
Generalized complementation. J. Comb. Theory B 42(3): 378-383 (1987) - Bojan Mohar:
The enumeration of akempic triangulations. J. Comb. Theory B 42(1): 14-23 (1987) - Bojan Mohar:
Simplicial schemes. J. Comb. Theory B 42(1): 68-86 (1987) - Andrew M. Odlyzko, Herbert S. Wilf:
Bandwidths and profiles of trees. J. Comb. Theory B 42(3): 348-370 (1987) - James G. Oxley:
A characterization of the ternary matroids with no M(K4)-minor. J. Comb. Theory B 42(2): 212-249 (1987) - Jean-Pierre Roudneff:
An inequality for 3-polytopes. J. Comb. Theory B 42(2): 156-166 (1987) - Jon Henry Sanders:
Circuit preserving edge maps II. J. Comb. Theory B 42(2): 146-155 (1987) - Paul D. Seymour
, Carsten Thomassen:
Characterization of even directed graphs. J. Comb. Theory B 42(1): 36-45 (1987) - Tamás Terlaky:
A finite crisscross method for oriented matroids. J. Comb. Theory B 42(3): 319-327 (1987) - Paul M. Terwilliger:
P and Q polynomial schemes with q = -1. J. Comb. Theory B 42(1): 64-67 (1987) - Carsten Thomassen:
Counterexamples to Adám's conjecture on arc reversals in directed graphs. J. Comb. Theory B 42(1): 128-130 (1987) - Alan Tucker:
Coloring perfect (K4 - e)-free graphs. J. Comb. Theory B 42(3): 313-318 (1987) - Geoff Whittle:
Modularity of tangential k-blocks. J. Comb. Theory B 42(1): 24-35 (1987) - Lin Yucai, Huang Guoxun, Li Jiongsheng:
Score vectors of Kotzig tournaments. J. Comb. Theory B 42(3): 328-336 (1987) - Thomas Zaslavsky
:
The biased graphs whose matroids are binary. J. Comb. Theory B 42(3): 337-347 (1987)
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-08-25 20:05 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