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 36 matches
- 2020
- Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu:
Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory 95(2): 256-266 (2020) - Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. J. Graph Theory 95(2): 240-255 (2020) - Aistis Atminas, Robert Brignall:
Well-quasi-ordering and finite distinguishing number. J. Graph Theory 95(1): 5-26 (2020) - Jackson Autry, Christopher O'Neill:
Sequentially embeddable graphs. J. Graph Theory 95(1): 27-33 (2020) - Maria Axenovich, Izolda Gorgol:
On induced Ramsey numbers for multiple copies of graphs. J. Graph Theory 95(3): 398-409 (2020) - József Balogh, Sárka Petrícková, Adam Zsolt Wagner:
Families in posets minimizing the number of comparable pairs. J. Graph Theory 95(4): 655-676 (2020) - Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz:
On DP-coloring of digraphs. J. Graph Theory 95(1): 76-98 (2020) - Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95(2): 267-289 (2020) - Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Edge precoloring extension of hypercubes. J. Graph Theory 95(3): 410-444 (2020) - Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95(3): 315-340 (2020) - Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray:
Coloring graphs with no induced five-vertex path or gem. J. Graph Theory 95(4): 527-542 (2020) - Attila Dankovics:
Low independence number and Hamiltonicity implies pancyclicity. J. Graph Theory 95(2): 181-191 (2020) - Jia-Li Du, Yan-Quan Feng, Pablo Spiga:
On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups. J. Graph Theory 95(4): 677-701 (2020) - Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. J. Graph Theory 95(3): 457-466 (2020) - Benjamin Espinoza, Paul Gartside, Max Pitz:
Graph-like compacta: Characterizations and Eulerian loops. J. Graph Theory 95(2): 209-239 (2020) - Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu:
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. J. Graph Theory 95(1): 125-137 (2020) - Jun Fujisawa, Hiroki Seno:
Edge proximity and matching extension in projective planar graphs. J. Graph Theory 95(3): 341-367 (2020) - Jie Han, Chuanyun Zang, Yi Zhao:
Matchings in k-partite k-uniform hypergraphs. J. Graph Theory 95(1): 34-58 (2020) - Daniel J. Harvey, Gordon F. Royle:
Chromatic roots at 2 and the Beraha number B10. J. Graph Theory 95(3): 445-456 (2020) - Ademir Hujdurovic:
Strong cliques in vertex-transitive graphs. J. Graph Theory 95(4): 543-564 (2020) - Nishad Kothari, Marcelo Henriques de Carvalho:
Generating simple near-bipartite bricks. J. Graph Theory 95(4): 594-637 (2020) - Qinghai Liu, Qing Cui, Xing Feng, Fuliang Lu:
A characterization of nonfeasible sets in matching covered graphs. J. Graph Theory 95(4): 509-526 (2020) - Zhidan Luo, Yuejian Peng:
Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles. J. Graph Theory 95(3): 368-383 (2020) - Martín Matamala, José Zamora:
Lines in bipartite graphs and in 2-metric spaces. J. Graph Theory 95(4): 565-585 (2020) - Jessica McDonald, Gregory J. Puleo:
t-Cores for (Δ+t) -edge-coloring. J. Graph Theory 95(2): 165-180 (2020) - Bojan Mohar, Hehui Wu:
Fractional chromatic number of a random subgraph. J. Graph Theory 95(3): 467-472 (2020) - Alexander Roberts:
Tree matchings. J. Graph Theory 95(1): 59-75 (2020) - Alex Scott, Paul D. Seymour:
A survey of χ-boundedness. J. Graph Theory 95(3): 473-504 (2020) - Gord Simons, Claude Tardif, David L. Wehlau:
Topologically 4-chromatic graphs and signatures of odd cycles. J. Graph Theory 95(2): 290-307 (2020) - Michael Tarsi:
Bounded-excess flows in cubic graphs. J. Graph Theory 95(1): 138-159 (2020)
skipping 6 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-10-02 06:08 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