![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 31 matches
- 2020
- Saieed Akbari
, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki
, R. Sherkati:
Orientations of graphs avoiding given lists on out-degrees. J. Graph Theory 93(4): 483-502 (2020) - Robert E. L. Aldred
, Jun Fujisawa
, Akira Saito
:
Distance matching extension and local structure of graphs. J. Graph Theory 93(1): 5-20 (2020) - Noga Alon, Jørgen Bang-Jensen
, Stéphane Bessy
:
Out-colourings of digraphs. J. Graph Theory 93(1): 88-112 (2020) - Michael Anastos, Deepak Bal
:
A Ramsey property of random regular and k -out graphs. J. Graph Theory 93(3): 363-371 (2020) - József Balogh, Lina Li
:
On the number of linear hypergraphs of large girth. J. Graph Theory 93(1): 113-141 (2020) - Anton Bernshteyn
, Alexandr V. Kostochka, Xuding Zhu:
Fractional DP-colorings of sparse graphs. J. Graph Theory 93(2): 203-221 (2020) - Fábio Botler
, Maycon Sambinelli
, Rafael S. Coelho
, Orlando Lee:
Gallai's path decomposition conjecture for graphs with treewidth at most 3. J. Graph Theory 93(3): 328-349 (2020) - Jason I. Brown
, David G. Wagner:
On the imaginary parts of chromatic roots. J. Graph Theory 93(2): 299-311 (2020) - Roman Cada
, Kenta Ozeki
, Kiyoshi Yoshimoto:
A complete bipartite graph without properly colored cycles of length four. J. Graph Theory 93(2): 168-180 (2020) - Kathie Cameron, Shenwei Huang, Irena Penev
, Vaidy Sivaraman
:
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. J. Graph Theory 93(4): 503-552 (2020) - Yan Cao, Guantao Chen, Shushan He, Guangming Jing
:
Ring graphs and Goldberg's bound on chromatic index. J. Graph Theory 93(3): 440-449 (2020) - Victor Chepoi
, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of Cartesian products. J. Graph Theory 93(1): 64-87 (2020) - Mustafa Demir
, C. A. Rodger
:
Embedding an edge-coloring of K(nr;λ1, λ2) into a Hamiltonian decomposition of K(nr+2;λ1, λ2). J. Graph Theory 93(1): 49-63 (2020) - Quentin Fortier, Csaba Király
, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. J. Graph Theory 93(2): 230-252 (2020) - Michitaka Furuya
, Shoichi Tsuchiya
:
Large homeomorphically irreducible trees in path-free graphs. J. Graph Theory 93(3): 372-394 (2020) - Jim Geelen
, Edward Lee
:
Naji's characterization of circle graphs. J. Graph Theory 93(1): 21-33 (2020) - Jan Goedgebeur
:
On minimal triangle-free 6-chromatic graphs. J. Graph Theory 93(1): 34-48 (2020) - Bobo Hua
, Yanhui Su
:
The first gap for total curvatures of planar graphs with nonnegative curvature. J. Graph Theory 93(3): 395-439 (2020) - Radek Husek
, Lucie Mohelníková, Robert Sámal
:
Group connectivity: Z4 vs Z22. J. Graph Theory 93(3): 317-327 (2020) - Paul Knappe
, Max Pitz
:
Circuits through prescribed edges. J. Graph Theory 93(4): 470-482 (2020) - Nir Lazarovich
, Arie Levit
:
Edge Kempe equivalence of regular graph covers. J. Graph Theory 93(4): 553-559 (2020) - Monika Pilsniak
, Marcin Stawiski
:
The optimal general upper bound for the distinguishing index of infinite graphs. J. Graph Theory 93(4): 463-469 (2020) - Pawel Pralat, Nick Wormald:
Almost all 5-regular graphs have a 3-flow. J. Graph Theory 93(2): 147-156 (2020) - Pu Qiao
, Xingzhi Zhan:
The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order. J. Graph Theory 93(2): 222-229 (2020) - Martin Rolek
:
Graphs with no K 9 = minor are 10-colorable. J. Graph Theory 93(4): 560-565 (2020) - Martín D. Safe
:
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property. J. Graph Theory 93(2): 268-298 (2020) - Jan-Christoph Schlage-Puchta, Peter Wagner
:
Complete graphs with no rainbow tree. J. Graph Theory 93(2): 157-167 (2020) - Daniel Soltész
:
Even cycle creating paths. J. Graph Theory 93(3): 350-362 (2020) - Stefan Steinerberger
:
Generalized designs on graphs: Sampling, spectra, symmetries. J. Graph Theory 93(2): 253-267 (2020) - Bhalchandra D. Thatte
:
The connected partition lattice of a graph and the reconstruction conjecture. J. Graph Theory 93(2): 181-202 (2020)
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp1.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 2024-07-04 16:10 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