![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.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 27 matches
- 1980
- H. L. Abbott, A. Liu, Bjarne Toft:
The enumeration problem for color critical linear hypergraphs. J. Comb. Theory B 29(1): 106-115 (1980) - Michael O. Albertson, David M. Berman:
The chromatic difference sequence of a graph. J. Comb. Theory B 29(1): 1-12 (1980) - Claude Benzaken:
Critical hypergraphs for the weak chromatic number. J. Comb. Theory B 29(3): 328-338 (1980) - Andreas Blass, Frank Harary, Zevi Miller:
Which trees are link graphs? J. Comb. Theory B 29(3): 277-292 (1980) - R. D. Boyle:
Reconstructing some bipartite graphs from their spanning trees. J. Comb. Theory B 29(2): 272-275 (1980) - William G. Bridges, Sam Toueg:
On the impossibility of Directed Moore Graphs. J. Comb. Theory B 29(3): 339-341 (1980) - Giovanni Criscuolo, Chung-Mo Kwok, Abbe Mowshowitz, Roberto Tortora:
The group and the minimal polynomial of a graph. J. Comb. Theory B 29(3): 293-302 (1980) - Dragomir Z. Djokovic
, Gary L. Miller:
Regular groups of automorphisms of cubic graphs. J. Comb. Theory B 29(2): 195-230 (1980) - Robert Donaghey:
Automorphisms on Catalan trees and bracketings. J. Comb. Theory B 29(1): 75-90 (1980) - Roger C. Entringer, Henda C. Swart:
Spanning cycles of nearly cubic graphs. J. Comb. Theory B 29(3): 303-309 (1980) - Herbert Fleischner:
Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. J. Comb. Theory B 29(2): 145-167 (1980) - Stephane Foldes, Richard Steinberg:
A topological space for which graph embeddability is undecidable. J. Comb. Theory B 29(3): 342-344 (1980) - J.-C. Fournier:
Isomorphismes d'hypergraphes par intersections équicardinales d'arêtes et configurations exclues. J. Comb. Theory B 29(3): 321-327 (1980) - András Frank
:
On chain and antichain families of a partially ordered set. J. Comb. Theory B 29(2): 176-184 (1980) - F. Göbel:
On a 1-1-correspondence between rooted trees and natural numbers. J. Comb. Theory B 29(1): 141-143 (1980) - Chris D. Godsil
:
Neighbourhoods of transitive graphs and GRR's. J. Comb. Theory B 29(1): 116-140 (1980) - Bill Jackson:
Hamilton cycles in regular 2-connected graphs. J. Comb. Theory B 29(1): 27-46 (1980) - Charles H. C. Little:
A characterization of planar cubic graphs. J. Comb. Theory B 29(2): 185-194 (1980) - László Lovász, Jaroslav Nesetril, Ales Pultr
:
On a product dimension of graphs. J. Comb. Theory B 29(1): 47-67 (1980) - Monroe M. Newborn, William O. J. Moser:
Optimal crossing-free Hamiltonian circuit drawings of Kn. J. Comb. Theory B 29(1): 13-26 (1980) - M. O'Keefe, P. K. Wong:
A smallest graph of girth 10 and valency 3. J. Comb. Theory B 29(1): 91-105 (1980) - Torrence D. Parsons:
Circulant graph imbeddings. J. Comb. Theory B 29(3): 310-320 (1980) - Carsten Thomassen:
Planarity and duality of finite and infinite graphs. J. Comb. Theory B 29(2): 244-271 (1980) - Timothy W. Tillson:
A Hamiltonian decomposition of K2m*, 2m >= 8. J. Comb. Theory B 29(1): 68-74 (1980) - Michel Las Vergnas:
Convexity in oriented matroids. J. Comb. Theory B 29(2): 231-243 (1980) - Stanley Wagon:
A bound on the chromatic number of graphs without certain induced subgraphs. J. Comb. Theory B 29(3): 345-346 (1980) - Neil L. White:
The transcendence degree of a coordinatization of a combinatorial geometry. J. Comb. Theory B 29(2): 168-175 (1980)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.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-07-10 06: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