![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 33 matches
- 2013
- M. Amin Bahmanian
, Christopher A. Rodger:
Embedding Factorizations for 3-Uniform Hypergraphs. J. Graph Theory 73(2): 216-224 (2013) - Asim Basu, Sandip Das, Shamik Ghosh, Malay K. Sen:
Circular-Arc Bigraphs and Its Subclasses. J. Graph Theory 73(4): 361-376 (2013) - Bostjan Bresar, Jérémie Chalopin, Victor Chepoi
, Matjaz Kovse, Arnaud Labourel, Yann Vaxès:
Retracts of Products of Chordal Graphs. J. Graph Theory 73(2): 161-180 (2013) - Jason I. Brown
, Karl Dilcher, Dante V. Manna:
On the Roots of Expected Independence Polynomials. J. Graph Theory 73(3): 322-326 (2013) - Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian:
Transversals in Trees. J. Graph Theory 73(1): 32-43 (2013) - Gerard Jennhwa Chang
, N. Narayanan
:
Strong Chromatic Index of 2-Degenerate Graphs. J. Graph Theory 73(2): 119-126 (2013) - Demetres Christofides
, Katherine Edwards, Andrew D. King:
A Note on Hitting Maximum and Maximal Cliques With a Stable Set. J. Graph Theory 73(3): 354-360 (2013) - Louis Esperet
, Jan van den Heuvel
, Frédéric Maffray, Félix Sipma:
Fire Containment in Planar Graphs. J. Graph Theory 73(3): 267-279 (2013) - Louis Esperet
, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73(1): 85-102 (2013) - Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying Codes in Line Graphs. J. Graph Theory 73(4): 425-448 (2013) - Jun Fujisawa
:
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs. J. Graph Theory 73(2): 146-160 (2013) - Zoltán Füredi, Younjin Kim:
Cycle-Saturated Graphs with Minimum Number of Edges. J. Graph Theory 73(2): 203-215 (2013) - David J. Galvin:
Maximizing H-Colorings of a Regular Graph. J. Graph Theory 73(1): 66-84 (2013) - Marina Groshaus, Leandro Montero:
On the Iterated Biclique Operator. J. Graph Theory 73(2): 181-190 (2013) - Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey:
Extremal Graphs With a Given Number of Perfect Matchings. J. Graph Theory 73(4): 449-468 (2013) - Subrahmanyam Kalyanasundaram
, Asaf Shapira:
A Note on Even Cycles and Quasirandom Tournaments. J. Graph Theory 73(3): 260-266 (2013) - Ross J. Kang
:
Improper Choosability and Property B. J. Graph Theory 73(3): 342-353 (2013) - Andrew D. King, Bruce A. Reed:
Asymptotics of the Chromatic Number for Quasi-Line Graphs. J. Graph Theory 73(3): 327-341 (2013) - Daniel Kotlar
, Ran Ziv:
On Serial Symmetric Exchanges of Matroid Bases. J. Graph Theory 73(3): 296-304 (2013) - Hanno Lefmann, Yury Person
:
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. J. Graph Theory 73(1): 1-31 (2013) - Cai Heng Li
, Hua Zhang:
On Finite 2-Path-Transitive Graphs. J. Graph Theory 73(2): 225-237 (2013) - Rong Luo, Yue Zhao:
A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture. J. Graph Theory 73(4): 469-482 (2013) - Giuseppe Mazzuoccolo
:
An Upper Bound for the Excessive Index of an r-Graph. J. Graph Theory 73(4): 377-376 (2013) - Martin Milanic
:
Hereditary Efficiently Dominatable Graphs. J. Graph Theory 73(4): 400-424 (2013) - Katsuhiro Ota, Gabriel Sueiro:
Forbidden Induced Subgraphs for Toughness. J. Graph Theory 73(2): 191-202 (2013) - Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
Locally Symmetric Graphs of Girth 4. J. Graph Theory 73(1): 44-65 (2013) - Michael Plantholt:
A Combined Logarithmic Bound on the Chromatic Index of Multigraphs. J. Graph Theory 73(3): 239-259 (2013) - Joseph P. Previte, Michelle Previte, Mary Vanderschoot:
The Growth of Limits of Vertex Replacement Rules. J. Graph Theory 73(1): 103-117 (2013) - Gábor N. Sárközy, Stanley M. Selkow, Fei Song:
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs. J. Graph Theory 73(2): 127-145 (2013) - Qiaojun Shu, Weifan Wang, Yiqiao Wang:
Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. J. Graph Theory 73(4): 386-399 (2013)
skipping 3 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-18 07:38 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