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 45 matches
- 1996
- Ghidewon Abay-Asmerom:
On genus imbeddings of the tensor product of graphs. J. Graph Theory 23(1): 67-76 (1996) - Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich:
On k-saturated graphs with restrictions on the degrees. J. Graph Theory 23(1): 1-20 (1996) - Jeff Angel, Ronald Evans:
Diameters of finite upper half plane graphs. J. Graph Theory 23(2): 129-137 (1996) - Richard P. Anstee:
Dividing a graph by degrees. J. Graph Theory 23(4): 377-384 (1996) - Armen S. Asratian:
Every 3-connected, locally connected, claw-free graph is Hamilton-connected. J. Graph Theory 23(2): 191-201 (1996) - Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman:
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23(3): 257-263 (1996) - Oleg V. Borodin:
Cyclic degree and cyclic coloring of 3-polytopes. J. Graph Theory 23(3): 225-231 (1996) - Oleg V. Borodin:
Structural theorem on plane graphs with application to the entire coloring number. J. Graph Theory 23(3): 233-239 (1996) - Michael F. Bridgland, Robert E. Jamison, Jennifer S. Zito:
The spanning trees forced by the path and the star. J. Graph Theory 23(4): 421-441 (1996) - Gunnar Brinkmann:
Fast generation of cubic graphs. J. Graph Theory 23(2): 139-149 (1996) - Leizhen Cai, Derek G. Corneil:
A generalization of perfect graphs - i-perfect graphs. J. Graph Theory 23(1): 87-103 (1996) - Nathaniel Dean, Robin Thomas, Xingxing Yu:
Spanning paths in infinite planar graphs. J. Graph Theory 23(2): 163-174 (1996) - Walter A. Deuber, Xuding Zhu:
Circular colorings of weighted graphs. J. Graph Theory 23(4): 365-376 (1996) - Nancy Eaton, David A. Grable:
Set intersection representations for almost all graphs. J. Graph Theory 23(3): 309-320 (1996) - Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley:
Hypercube subgraphs with minimal detours. J. Graph Theory 23(2): 119-128 (1996) - Cong Fan:
On generalized cages. J. Graph Theory 23(1): 21-31 (1996) - Suohai Fan:
Bipartite graphs and their endomorphism monoids. J. Graph Theory 23(1): 49-52 (1996) - Genghua Fan, Hal A. Kierstead:
Partitioning a graph into two square-cycles. J. Graph Theory 23(3): 241-256 (1996) - Ralph J. Faudree, András Gyárfás:
Endpoint extendable paths in tournaments. J. Graph Theory 23(3): 303-307 (1996) - Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
An edge coloring problem for graph products. J. Graph Theory 23(3): 297-302 (1996) - David C. Fisher:
Squaring a tournament: A proof of Dean's conjecture. J. Graph Theory 23(1): 43-48 (1996) - Anna Galluccio, Martin Loebl:
(p, q)-odd digraphs. J. Graph Theory 23(2): 175-184 (1996) - Andrew Kotlov, László Lovász:
The rank and size of graphs. J. Graph Theory 23(2): 185-189 (1996) - Jin Ho Kwak, Jaeun Lee:
Enumeration of connected graph coverings. J. Graph Theory 23(2): 105-109 (1996) - Jaroslaw Kwapisz:
On the spectral radius of a directed graph. J. Graph Theory 23(4): 405-411 (1996) - Van Bang Le:
Cycle-perfect graphs are perfect. J. Graph Theory 23(4): 351-353 (1996) - Yusheng Li, Cecil C. Rousseau:
Fan-complete graph Ramsey numbers. J. Graph Theory 23(4): 413-420 (1996) - Chiang Lin, Tay-Woei Shyu:
A necessary and sufficient condition for the star decomposition of complete graphs. J. Graph Theory 23(4): 361-364 (1996) - Frédéric Maffray, Oscar Porto, Myriam Preissmann:
A generalization of simplicial elimination orderings. J. Graph Theory 23(2): 203-208 (1996) - Jaroslav Nesetril, Xuding Zhu:
On bounded treewidth duality of graphs. J. Graph Theory 23(2): 151-162 (1996)
skipping 15 more matches
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-30 16: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