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
- 2007
- Noga Alon, Benny Sudakov:
On graphs with subgraphs having large independence numbers. J. Graph Theory 56(2): 149-157 (2007) - Suman Balasubramanian, Edward Dobson:
Constructing trees in graphs with no K2, s. J. Graph Theory 56(4): 301-310 (2007) - Paul N. Balister, Béla Bollobás, Stefanie Gerke:
The generalized Randic index of trees. J. Graph Theory 56(4): 270-286 (2007) - József Balogh, Béla Bollobás, Robert Morris:
Hereditary properties of combinatorial structures: Posets and oriented graphs. J. Graph Theory 56(4): 311-332 (2007) - Drago Bokal:
On the crossing numbers of Cartesian products with trees. J. Graph Theory 56(4): 287-300 (2007) - David E. Brown, Arthur H. Busch, J. Richard Lundgren:
Interval Tournaments. J. Graph Theory 56(1): 72-81 (2007) - Gregory L. Cherlin, Lasse Tallgren:
Universal graphs with a forbidden near-path or 2-bouquet. J. Graph Theory 56(1): 41-63 (2007) - Emanuela Fachini, János Körner:
Cross-intersecting couples of graphs. J. Graph Theory 56(2): 105-112 (2007) - Herbert Fleischner, François Genest, Bill Jackson:
Compatible circuit decompositions of 4-regular graphs. J. Graph Theory 56(3): 227-240 (2007) - Robert E. Jamison, Eric Mendelsohn:
On the chromatic spectrum of acyclic decompositions of graphs. J. Graph Theory 56(2): 83-104 (2007) - Tomás Kaiser, Daniel Král, Ladislav Stacho:
Tough spiders. J. Graph Theory 56(1): 23-40 (2007) - Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. J. Graph Theory 56(4): 249-269 (2007) - Tomás Kaiser, Riste Skrekovski:
T-joins intersecting small edge-cuts in graphs. J. Graph Theory 56(1): 64-71 (2007) - Ken-ichi Kawarabayashi, Zi-Xia Song:
Independence number and clique minors. J. Graph Theory 56(3): 219-226 (2007) - Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar:
Maximum number of colorings of (2k, k2)-graphs. J. Graph Theory 56(2): 135-148 (2007) - Zaiping Lu, Sanming Zhou:
Finite symmetric graphs with two-arc transitive quotients II. J. Graph Theory 56(3): 167-193 (2007) - Dhruv Mubayi, Jason Williford:
On the independence number of the Erdös-Rényi and projective norm graphs and a related hypergraph. J. Graph Theory 56(2): 113-127 (2007) - Tomoki Nakamigawa:
Vertex disjoint equivalent subgraphs of order 3. J. Graph Theory 56(3): 159-166 (2007) - Yunsun Nam:
Ore-type condition for the existence of connected factors. J. Graph Theory 56(3): 241-248 (2007) - Shengjun Pan, R. Bruce Richter:
The crossing number of K11 is 100. J. Graph Theory 56(2): 128-134 (2007) - Kara Walcher Shavo:
A result on extendibility in the powers of graphs. J. Graph Theory 56(1): 1-22 (2007) - Yusuke Suzuki, Takahiro Watanabe:
Generating even triangulations of the projective plane. J. Graph Theory 56(4): 333-349 (2007) - Douglas R. Woodall:
The average degree of an edge-chromatic critical graph II. J. Graph Theory 56(3): 194-218 (2007)
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 06:51 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