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 19 matches
- 2014
- Toru Araki:
Dirac's Condition for Completely Independent Spanning Trees. J. Graph Theory 77(3): 171-179 (2014) - Jørgen Bang-Jensen, Jing Huang:
Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs. J. Graph Theory 77(4): 278-298 (2014) - Jørgen Bang-Jensen, Alessandro Maddaloni:
Arc-Disjoint Paths in Decomposable Digraphs. J. Graph Theory 77(2): 89-110 (2014) - Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-Distance Coloring of Sparse Graphs. J. Graph Theory 77(3): 190-218 (2014) - Pablo De Caria:
The Images of the Clique Operator and Its Square are Different. J. Graph Theory 77(1): 39-57 (2014) - Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu:
Degree Conditions for Spanning Brooms. J. Graph Theory 77(3): 237-250 (2014) - Karen L. Collins, Megan E. Heenehan:
Constructing Graphs with No Immersion of Large Complete Graphs. J. Graph Theory 77(1): 1-18 (2014) - Mark N. Ellingham, Justin Z. Schroeder:
Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications. J. Graph Theory 77(3): 219-236 (2014) - Louis Esperet, Giuseppe Mazzuoccolo:
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings. J. Graph Theory 77(2): 144-157 (2014) - Odile Favaron, Mekkia Kouider:
Even Factors of Large Size. J. Graph Theory 77(1): 58-67 (2014) - Samuel Fiorini, Audrey Herinckx:
A Tighter Erdős-Pósa Function for Long Cycles. J. Graph Theory 77(2): 111-116 (2014) - Herbert Fleischner, Roland Häggkvist:
Cycle Double Covers in Cubic Graphs having Special Structures. J. Graph Theory 77(2): 158-170 (2014) - Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec:
Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory 77(4): 299-329 (2014) - John Lenz, Dhruv Mubayi:
Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs. J. Graph Theory 77(1): 19-38 (2014) - Ryan R. Martin, Tracy McKay:
On the Edit Distance from K2, t-Free Graphs. J. Graph Theory 77(2): 117-143 (2014) - Thomas A. McCourt:
Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph. J. Graph Theory 77(1): 68-87 (2014) - Dirk Meierling, Dieter Rautenbach, Thomas Sasse:
The Erdős-Pósa Property for Long Circuits. J. Graph Theory 77(4): 251-259 (2014) - Jakub Przybylo:
On the Facial Thue Choice Index via Entropy Compression. J. Graph Theory 77(3): 180-189 (2014) - Cândida Nunes da Silva, Claudio L. Lucchesi:
3-Flows and Combs. J. Graph Theory 77(4): 260-277 (2014)
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-10-06 04: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