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 23 matches
- 2004
- Isolde Adler:
Marshals, monotone marshals, and hypertree-width. J. Graph Theory 47(4): 275-296 (2004) - Noga Alon, Gil Kaplan, Arieh Lev, Yehuda Roditty, Raphael Yuster:
Dense graphs are antimagic. J. Graph Theory 47(4): 297-309 (2004) - Maria Axenovich, Tao Jiang, André Kündgen:
Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1): 9-28 (2004) - Jørgen Bang-Jensen, Stephan Brandt:
Subgraphs in vertex neighborhoods of Kr-free graphs. J. Graph Theory 47(1): 29-38 (2004) - Guillaume Fertin, André Raspaud, Bruce A. Reed:
Star coloring of graphs. J. Graph Theory 47(3): 163-182 (2004) - Lev Yu. Glebsky, Gelasio Salazar:
The crossing number of Cm × Cn is as conjectured for n >= m(m + 1). J. Graph Theory 47(1): 53-72 (2004) - Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. J. Graph Theory 47(3): 183-202 (2004) - S. Louis Hakimi, Edward F. Schmeichel:
Improved bounds for the chromatic number of a graph. J. Graph Theory 47(3): 217-225 (2004) - Hamed Hatami, Ruzbeh Tusserkani:
On the complexity of the circular chromatic number. J. Graph Theory 47(3): 226-230 (2004) - Frédéric Havet:
Pancyclic arcs and connectivity in tournaments. J. Graph Theory 47(2): 87-110 (2004) - Peter Keevash, Benny Sudakov:
Packing triangles in a graph and its complement. J. Graph Theory 47(3): 203-216 (2004) - Andrzej Kisielewicz, Wojciech Peisert:
Pseudo-random properties of self-complementary symmetric graphs. J. Graph Theory 47(4): 310-316 (2004) - Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number and circular chromatic number for distance graphs with large clique size. J. Graph Theory 47(2): 129-146 (2004) - Tomasz Luczak, Jaroslav Nesetril:
Note on projective graphs. J. Graph Theory 47(2): 81-86 (2004) - Tomasz Luczak, Florian Pfender:
Claw-free 3-connected P11-free graphs are hamiltonian. J. Graph Theory 47(2): 111-121 (2004) - Vladimir Nikiforov, Richard H. Schelp:
Cycles and paths in graphs with large minimal degree. J. Graph Theory 47(1): 39-52 (2004) - Michael J. Pelsmajer:
Equitable list-coloring for graphs of maximum degree 3. J. Graph Theory 47(1): 1-8 (2004) - Michael Plantholt:
Overfull conjecture for graphs with high minimum degree. J. Graph Theory 47(2): 73-80 (2004) - Artem V. Pyatkin:
Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. J. Graph Theory 47(2): 122-128 (2004) - Liang Sun, Xingxing Yu:
Positively curved cubic plane graphs are finite. J. Graph Theory 47(4): 241-274 (2004) - Xiaodong Xu, Xie Zheng, Stanislaw P. Radziszowski:
A constructive approach for the lower bounds on the Ramsey numbers R (s, t). J. Graph Theory 47(3): 231-239 (2004) - Xingxing Yu:
Infinite paths in planar graphs I: Graphs with radial nets. J. Graph Theory 47(2): 147-162 (2004) - Yaming Yu:
Forbidden minors for wye-delta-wye reducibility. J. Graph Theory 47(4): 317-321 (2004)
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-09-26 09: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