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 29 matches
- 2013
- Noga Alon:
A Note on Degenerate and Spectrally Degenerate Graphs. J. Graph Theory 72(1): 1-6 (2013) - Francesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Bryan L. Shader, Pauline van den Driessche, Hein van der Holst:
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph. J. Graph Theory 72(2): 146-177 (2013) - Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Toughness and Vertex Degrees. J. Graph Theory 72(2): 209-219 (2013) - Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. J. Graph Theory 72(3): 291-312 (2013) - J. Adrian Bondy, Jayme Luiz Szwarcfiter:
Induced Decompositions of Graphs. J. Graph Theory 72(4): 462-477 (2013) - Oleg V. Borodin, Anna O. Ivanova:
Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles. J. Graph Theory 72(4): 374-397 (2013) - Ryan C. Bunge, Avapa Chantasartrassmee, Saad I. El-Zanati, Charles Vanden Eynden:
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs. J. Graph Theory 72(1): 90-111 (2013) - Min Chen, André Raspaud, Weifan Wang:
6-Star-Coloring of Subcubic Graphs. J. Graph Theory 72(2): 128-145 (2013) - Matt DeVos, Jessica McDonald, Diego Scheide:
Average Degree in Graph Powers. J. Graph Theory 72(1): 7-18 (2013) - Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Star Chromatic Index. J. Graph Theory 72(3): 313-326 (2013) - Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt:
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72(1): 112-121 (2013) - Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek, Petr Vrána:
On Forbidden Pairs Implying Hamilton-Connectedness. J. Graph Theory 72(3): 327-345 (2013) - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Compatible Normal Odd Partitions in Cubic Graphs. J. Graph Theory 72(4): 440-461 (2013) - Serge Gaspers, Matthias Mnich:
Feedback Vertex Sets in Tournaments. J. Graph Theory 72(1): 72-89 (2013) - Assaf Goldberger, Michael Neumann:
On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum. J. Graph Theory 72(2): 178-208 (2013) - Michael A. Henning, Anders Yeo:
Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. J. Graph Theory 72(2): 220-245 (2013) - Elad Horev, Michael Lomonosov:
On r-Connected Graphs with No Semi-topological r-Wheel. J. Graph Theory 72(3): 267-290 (2013) - Jianfeng Hou, Jian-Liang Wu:
Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs". J. Graph Theory 72(3): 364-365 (2013) - Vladimir P. Korzhik, Bojan Mohar:
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. J. Graph Theory 72(1): 30-71 (2013) - Hsin-Hao Lai, Ko-Wei Lih:
Acyclic List Edge Coloring of Graphs. J. Graph Theory 72(3): 247-266 (2013) - Brendan D. McKay:
A Note on the History of the Four-Colour Conjecture. J. Graph Theory 72(3): 361-363 (2013) - Luke Postle, Noah Streib, Carl Yerger:
Pebbling Graphs of Diameter Three and Four. J. Graph Theory 72(4): 398-417 (2013) - Landon Rabern:
Destroying Noncomplete Regular Components in Graph Partitions. J. Graph Theory 72(2): 123-127 (2013) - Marko Radovanovic, Kristina Vuskovic:
A Class of Three-Colorable Triangle-Free Graphs. J. Graph Theory 72(4): 430-439 (2013) - Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Unit Interval Graphs of Open and Closed Intervals. J. Graph Theory 72(4): 418-429 (2013) - Justin Southey, Michael A. Henning:
Edge Weighting Functions on Dominating Sets. J. Graph Theory 72(3): 346-360 (2013) - Martin Trinks:
The Merrifield-Simmons Conjecture Holds for Bipartite Graphs. J. Graph Theory 72(4): 478-486 (2013) - Emil R. Vaughan:
An Asymptotic Version of the Multigraph 1-Factorization Conjecture. J. Graph Theory 72(1): 19-29 (2013) - Zelealem B. Yilma:
Antimagic Properties of Graphs with Large Maximum Degree. J. Graph Theory 72(4): 367-373 (2013)
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 2025-02-05 19:11 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