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 24 matches
- 1997
- Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen:
P3-isomorphisms for graphs. J. Graph Theory 26(1): 35-51 (1997) - Béla Bollobás, Andrew Thomason:
On the girth of hamiltonian weakly pancyclic graphs. J. Graph Theory 26(3): 165-173 (1997) - Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
Total colorings of planar graphs with large maximum degree. J. Graph Theory 26(1): 53-59 (1997) - Anita C. Burris, Richard H. Schelp:
Vertex-distinguishing proper edge-colorings. J. Graph Theory 26(2): 73-82 (1997) - Niall Cairnie, Keith Edwards:
Some results on the achromatic number. J. Graph Theory 26(3): 129-136 (1997) - Kathie Cameron, Jack Edmonds:
Lambda composition. J. Graph Theory 26(1): 9-16 (1997) - Gregory L. Cherlin, Niandong Shi, Lasse Tallgren:
Graphs omitting a bushy tree. J. Graph Theory 26(4): 203-210 (1997) - Peter Dankelmann, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs and digraphs. J. Graph Theory 26(1): 27-34 (1997) - Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa:
Triangles in 2-factorizations. J. Graph Theory 26(2): 83-94 (1997) - Mohamed H. El-Zahar:
A graph-theoretic version of the union-closed sets conjecture. J. Graph Theory 26(3): 155-163 (1997) - Peter C. Fishburn, Paul E. Wright:
Bandwidth edge counts for linear arrangements of rectangular grids. J. Graph Theory 26(4): 195-202 (1997) - Kathryn Fraughnaugh, Stephen C. Locke:
Lower bounds on size and independence in K4-free graphs. J. Graph Theory 26(2): 61-71 (1997) - Anthony J. W. Hilton, C. Zhao:
Coloring graphs which have equibipartite complements. J. Graph Theory 26(4): 183-194 (1997) - A. Johnson, Fred C. Holroyd, S. Stahl:
Multichromatic numbers, star chromatic numbers and Kneser graphs. J. Graph Theory 26(3): 137-145 (1997) - Andrei Kotlov:
Rank and chromatic number of a graph. J. Graph Theory 26(1): 1-8 (1997) - Felix Lazebnik, Ping Wang:
On the structure of extremal graphs of high girth. J. Graph Theory 26(3): 147-153 (1997) - Norbert Polat:
End-faithful spanning trees in T1-free graphs. J. Graph Theory 26(4): 175-181 (1997) - Lubomír Soltés:
Nonbipartite graphs with the repeated degree property. J. Graph Theory 26(1): 17-25 (1997) - Debra Mullins Strickland:
Building fences around the chromatic coefficients. J. Graph Theory 26(3): 123-128 (1997) - Alasdair Urquhart:
The graph constructions of Hajós and Ore. J. Graph Theory 26(4): 211-215 (1997) - Honghui Wan:
Upper bounds for ramsey numbers R(3, 3, ⋖, 3) and Schur numbers. J. Graph Theory 26(3): 119-122 (1997) - Hong Wang:
Packing two bipartite graphs into a complete bipartite graph. J. Graph Theory 26(2): 95-104 (1997) - Hong Wang:
Covering a graph with cycles passing through given edges. J. Graph Theory 26(2): 105-109 (1997) - Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang:
Signed degree sequences of signed graphs. J. Graph Theory 26(2): 111-117 (1997)
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-29 13:35 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