Остановите войну!
for scientists:
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
- 2014
- Zbigniew R. Bogdanowicz:
Chordal 2-Connected Graphs and Spanning Trees. J. Graph Theory 76(3): 224-235 (2014) - Ya-Chen Chen:
Minimum K2, 3-Saturated Graphs. J. Graph Theory 76(4): 309-322 (2014) - Guantao Chen, Manzhan Gu, Nana Li:
On Maximum Edge Cuts of Connected Digraphs. J. Graph Theory 76(1): 1-19 (2014) - Maria Chudnovsky, Peter Maceli:
Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the H6-Conjecture. J. Graph Theory 76(4): 249-261 (2014) - Ross Churchley, Jing Huang:
On the Polarity and Monopolarity of Graphs. J. Graph Theory 76(2): 138-148 (2014) - Jonathan Cutler, A. J. Radcliffe:
Extremal Graphs for Homomorphisms II. J. Graph Theory 76(1): 42-59 (2014) - Andrzej Dudek, Dhruv Mubayi:
On Generalized Ramsey Numbers for 3-Uniform Hypergraphs. J. Graph Theory 76(3): 217-223 (2014) - John Engbers, David J. Galvin:
Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree. J. Graph Theory 76(2): 149-168 (2014) - Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat:
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. J. Graph Theory 76(2): 129-137 (2014) - Mirko Hornák, Danjun Huang, Weifan Wang:
On Neighbor-Distinguishing Index of Planar Graphs. J. Graph Theory 76(4): 262-278 (2014) - Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the 3-Local Profiles of Graphs. J. Graph Theory 76(3): 236-248 (2014) - Cheyu Lin, Tsai-Lien Wong, Xuding Zhu:
Circular Chromatic Indices of Regular Graphs. J. Graph Theory 76(3): 169-193 (2014) - Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
The Cubic Vertices of Minimal Bricks. J. Graph Theory 76(1): 20-33 (2014) - Henry Liu, Teresa Sousa:
Monochromatic Kr-Decompositions of Graphs. J. Graph Theory 76(2): 89-100 (2014) - Allan Lo:
A Dirac Type Condition for Properly Coloured Paths and Cycles. J. Graph Theory 76(1): 60-87 (2014) - Zbigniew Lonc, Nataliya Petryshyn:
On Rooted Packings, Decompositions, and Factors of Graphs. J. Graph Theory 76(2): 106-128 (2014) - Piotr Majerski, Jakub Przybylo:
Total Vertex Irregularity Strength of Dense Graphs. J. Graph Theory 76(1): 34-41 (2014) - Klas Markström:
Two Questions of Erdős on Hypergraphs above the Turán Threshold. J. Graph Theory 76(2): 101-105 (2014) - Brendan D. McKay, Pascal Schweitzer:
Switching Reconstruction of Digraphs. J. Graph Theory 76(4): 279-296 (2014) - Simon Mukwembi:
Average Distance, Independence Number, and Spanning Trees. J. Graph Theory 76(3): 194-199 (2014) - Petros A. Petrosyan, Hrant Khachatrian:
Interval Non-edge-Colorable Bipartite Graphs and Multigraphs. J. Graph Theory 76(3): 200-216 (2014) - Landon Rabern:
Coloring Graphs with Dense Neighborhoods. J. Graph Theory 76(4): 323-340 (2014) - Michael Schubert, Eckhard Steffen:
The Set of Circular Flow Numbers of Regular Graphs. J. Graph Theory 76(4): 297-308 (2014)
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-08-22 16:33 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