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 25 matches
- 2003
- Lowell Abrams, Daniel C. Slilaty:
An algebraic characterization of projective-planar graphs. J. Graph Theory 42(4): 320-331 (2003) - Paul N. Balister, O. M. Riordan, Richard H. Schelp:
Vertex-distinguishing edge colorings of graphs. J. Graph Theory 42(2): 95-109 (2003) - Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo:
Small degree out-branchings. J. Graph Theory 42(4): 297-307 (2003) - C. Paul Bonnington, Mark E. Watkins:
Planar embeddings with infinite faces. J. Graph Theory 42(4): 257-275 (2003) - Henning Bruhn:
Generating cycles in graphs with at most one end. J. Graph Theory 42(4): 342-349 (2003) - Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao:
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. J. Graph Theory 42(4): 308-319 (2003) - Marston D. E. Conder, Margaret Morton, Cheryl E. Praeger:
Two-arc closed subsets of graphs. J. Graph Theory 42(4): 350-364 (2003) - Mathew Cropper, András Gyárfás, Jenö Lehel:
Edge list multicoloring trees: An extension of Hall's theorem. J. Graph Theory 42(3): 246-255 (2003) - Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - Tomás Feder, Pavol Hell, Jing Huang:
Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42(1): 61-80 (2003) - Herbert Fleischner, Gert Sabidussi:
3-colorability of 4-regular hamiltonian graphs. J. Graph Theory 42(2): 125-140 (2003) - Jan Kristian Haugland:
Classification of certain subgraphs of the 3-dimensional grid. J. Graph Theory 42(1): 34-60 (2003) - David S. Herscovici:
Graham's pebbling conjecture on products of cycles. J. Graph Theory 42(2): 141-154 (2003) - Jan van den Heuvel, Sean McGuinness:
Coloring the square of a planar graph. J. Graph Theory 42(2): 110-124 (2003) - Yoshiyasu Ishigami, Tao Jiang:
Vertex-disjoint cycles containing prescribed vertices. J. Graph Theory 42(4): 276-296 (2003) - Robert E. Jamison, Tao Jiang, Alan C. H. Ling:
Constrained Ramsey numbers of graphs. J. Graph Theory 42(1): 1-16 (2003) - Michael Krivelevich, Benny Sudakov:
Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42(1): 17-33 (2003) - Hong-Jian Lai:
Nowhere-zero 3-flows in locally connected graphs. J. Graph Theory 42(3): 211-219 (2003) - Brenda J. Latka:
Structure theorem for tournaments omitting N5. J. Graph Theory 42(3): 165-192 (2003) - Manoel Lemos, James G. Oxley:
On removable cycles through every edge. J. Graph Theory 42(2): 155-164 (2003) - Dhruv Mubayi:
Coloring with three-colored subgraphs. J. Graph Theory 42(3): 193-198 (2003) - Oleg Pikhurko:
Size ramsey numbers of stars versus 4-chromatic graphs. J. Graph Theory 42(3): 220-233 (2003) - Benny Pinontoan, R. Bruce Richter:
Crossing numbers of sequences of graphs II: Planar tiles. J. Graph Theory 42(4): 332-341 (2003) - Philippe Pitteloud:
Estimates of coefficients of chromatic polynomials and numbers of cliques of (c, n, m)-graphs. J. Graph Theory 42(2): 81-94 (2003) - Lutz Volkmann:
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number. J. Graph Theory 42(3): 234-245 (2003)
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-28 13:41 CET 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