![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 60 matches
- 1987
- Houria Aït-Djafer:
Linear arboricity for graphs with multiple edges. J. Graph Theory 11(2): 135-140 (1987) - Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann:
Highly irregular graphs. J. Graph Theory 11(2): 235-249 (1987) - Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour
:
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory 11(3): 367-371 (1987) - Thomas Andreae:
On the Interval Number of a Triangulated Graph. J. Graph Theory 11(3): 273-280 (1987) - Dan Archdeacon:
A note on defective colorings of graphs in surfaces. J. Graph Theory 11(4): 517-519 (1987) - David W. Bange, Anthony E. Barkauskas, Linda H. Host:
Class-reconstruction of total graphs. J. Graph Theory 11(2): 221-230 (1987) - Abdelhamid Benhocine, Jean-Luc Fouquet:
Pancyclic and panconnected line graphs. J. Graph Theory 11(3): 385-398 (1987) - Gary S. Bloom, Stefan A. Burr:
On unavoidable digraphs in orientations of graphs. J. Graph Theory 11(4): 453-462 (1987) - Haitze J. Broersma
, Henk Jan Veldman:
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11(3): 399-407 (1987) - Andries E. Brouwer, Henk Jan Veldman:
Contractibility and NP-completeness. J. Graph Theory 11(1): 71-79 (1987) - Jason I. Brown
, Derek G. Corneil:
On generalized graph colorings. J. Graph Theory 11(1): 87-99 (1987) - Peter J. Cameron
, Amanda G. Chetwynd
, John J. Watkins:
Decomposition of snarks. J. Graph Theory 11(1): 13-19 (1987) - Yair Caro:
Extremal problems concerning transformations of the edges of the complete hypergraphs. J. Graph Theory 11(1): 25-37 (1987) - Paul A. Catlin:
Spanning trails. J. Graph Theory 11(2): 161-167 (1987) - Fan R. K. Chung, Paul Erdös:
On unavoidable hypergraphs. J. Graph Theory 11(2): 251-263 (1987) - Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra:
Four classes of perfectly orderable graphs. J. Graph Theory 11(4): 481-495 (1987) - Marston D. E. Conder
:
A new 5-arc-transitive cubic graph. J. Graph Theory 11(3): 303-307 (1987) - Michele Conforti, Derek Gordon Corneil, Ali Ridha Mahjoub:
Ki-covers. II. Ki-perfect graphs. J. Graph Theory 11(4): 569-584 (1987) - Reinhard Diestel:
A separation property of planar triangulations. J. Graph Theory 11(1): 43-52 (1987) - Stephen J. Dow, Douglas F. Rall
, Peter J. Slater:
Convex labelings of trees. J. Graph Theory 11(1): 59-70 (1987) - Pierre Duchet:
A sufficient condition for a digraph to be kernel-perfect. J. Graph Theory 11(1): 81-85 (1987) - Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar:
On the equality of the grundy and ochromatic numbers of a graph. J. Graph Theory 11(2): 157-159 (1987) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Extremal problems involving neighborhood unions. J. Graph Theory 11(4): 555-564 (1987) - Zoltán Füredi:
The number of maximal independent sets in connected graphs. J. Graph Theory 11(4): 463-470 (1987) - Joseph A. Gallian, David Witte:
When the cartesian product of two directed cycles is hyperhamiltonian. J. Graph Theory 11(1): 21-24 (1987) - I. P. Goulden, David M. Jackson:
Labelled graphs with vertices of degree at least three. J. Graph Theory 11(2): 177-189 (1987) - Jonathan L. Gross, Merrick L. Furst:
Hierarchy for imbedding-distribution invariants of a graph. J. Graph Theory 11(2): 205-220 (1987) - Branko Grünbaum, Geoffrey C. Shephard:
Edge-transitive planar graphs. J. Graph Theory 11(2): 141-155 (1987) - Denis Hanson, Bjarne Toft:
Edge-colored saturated graphs. J. Graph Theory 11(2): 191-196 (1987) - Nora Hartsfield:
On regular self-complementary graphs. J. Graph Theory 11(4): 537-538 (1987)
skipping 30 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.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-09-04 08:56 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