Остановите войну!
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 26 matches
- 2017
- Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Conditions on Ramsey Nonequivalence. J. Graph Theory 86(2): 159-192 (2017) - Amir Ban:
Decomposing Weighted Graphs. J. Graph Theory 86(2): 250-254 (2017) - Michael D. Barrus, Michael Ferrara, Jennifer Vandenbussche, Paul S. Wenger:
Colored Saturation Parameters for Rainbow Subgraphs. J. Graph Theory 86(4): 375-386 (2017) - Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-Free Chordal Graphs. J. Graph Theory 86(1): 42-77 (2017) - Gunnar Brinkmann, Jan Goedgebeur:
Generation of Cubic Graphs and Snarks with Large Girth. J. Graph Theory 86(2): 255-272 (2017) - Zhi-Hong Chen:
Hamiltonicity and Degrees of Adjacent Vertices in Claw-Free Graphs. J. Graph Theory 86(2): 193-212 (2017) - Guantao Chen, Songling Shan:
Vizing's 2-Factor Conjecture Involving Large Maximum Degree. J. Graph Theory 86(4): 422-438 (2017) - Maria Chudnovsky, Irene Lo:
Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs. J. Graph Theory 86(1): 5-41 (2017) - Brian P. Corr, Wei Jin, Csaba Schneider:
Finite 2-Distance Transitive Graphs. J. Graph Theory 86(1): 78-91 (2017) - Daniel W. Cranston, Landon Rabern:
Subcubic Edge-Chromatic Critical Graphs Have Many Edges. J. Graph Theory 86(1): 122-136 (2017) - Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl:
On the Size-Ramsey Number of Hypergraphs. J. Graph Theory 86(1): 104-121 (2017) - Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi:
Flows and Bisections in Cubic Graphs. J. Graph Theory 86(2): 149-158 (2017) - Erica Flapan, Sarah Rundell, Madeline Wyse:
Asymmetric 2-colorings of graphs. J. Graph Theory 86(4): 361-374 (2017) - Tony Huynh, Ringi Kim:
Tree-Chromatic Number Is Not Equal to Path-Chromatic Number*. J. Graph Theory 86(2): 213-222 (2017) - Chula J. Jayawardene, Cecil C. Rousseau, Heiko Harborth:
On Path Convex Ramsey Numbers. J. Graph Theory 86(3): 286-294 (2017) - Hal A. Kierstead, Landon Rabern:
Extracting List Colorings from Large Independent Sets. J. Graph Theory 86(3): 315-328 (2017) - Natasha Komarov, John Mackey:
On the Number of 5-Cycles in a Tournament. J. Graph Theory 86(3): 341-356 (2017) - Chun-Hung Liu, Luke Postle:
On the Minimum Edge-Density of 4-Critical Graphs of Girth Five. J. Graph Theory 86(4): 387-405 (2017) - Po-Shen Loh, Siyoung Oh:
Cops and Robbers on Planar-Directed Graphs. J. Graph Theory 86(3): 329-340 (2017) - John Maharry, Daniel C. Slilaty:
Projective-Planar Graphs with no K3, 4-Minor. II. J. Graph Theory 86(1): 92-103 (2017) - Tilen Marc:
Classification of Vertex-Transitive Cubic Partial Cubes. J. Graph Theory 86(4): 406-421 (2017) - Colin McDiarmid, Nikola Yolov:
Hamilton Cycles, Minimum Degree, and Bipartite Holes. J. Graph Theory 86(3): 277-285 (2017) - Piotr Micek, Veit Wiechert:
Topological Minors of Cover Graphs and Dimension. J. Graph Theory 86(3): 295-314 (2017) - Zsolt Adam Wagner:
Large Subgraphs in Rainbow-Triangle Free Colorings. J. Graph Theory 86(2): 141-148 (2017) - Tianxing Yao, Guofei Zhou:
Constructing a Family of 4-Critical Planar Graphs with High Edge Density. J. Graph Theory 86(2): 244-249 (2017) - Carol T. Zamfirescu:
On Non-Hamiltonian Graphs for which every Vertex-Deleted Subgraph Is Traceable. J. Graph Theory 86(2): 223-243 (2017)
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-05-25 08:19 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