![](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 46 matches
- 2023
- Noga Alon, Michael Krivelevich
, Benny Sudakov:
Complete minors and average degree: A short proof. J. Graph Theory 103(3): 599-602 (2023) - Jasine Babu, Deepu Benson
, Deepak Rajendraprasad
:
Improved bounds for the oriented radius of mixed multigraphs. J. Graph Theory 103(4): 674-689 (2023) - József Balogh, Sean English
, Emily Heath
, Robert A. Krueger:
Lower bounds on the Erdős-Gyárfás problem via color energy graphs. J. Graph Theory 103(2): 378-409 (2023) - Jørgen Bang-Jensen
, Kasper Skov Johansen, Anders Yeo
:
Making a tournament k $k$-strong. J. Graph Theory 103(1): 5-11 (2023) - Anton Bernshteyn
, Eugene Lee:
Weak degeneracy of graphs. J. Graph Theory 103(4): 607-634 (2023) - Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles of any length in regular bipartite tournaments. J. Graph Theory 103(2): 186-211 (2023) - Felix Bock, Johannes Pardey
, Lucia Draque Penso, Dieter Rautenbach
:
A bound on the dissociation number. J. Graph Theory 103(4): 661-673 (2023) - Fábio Botler
, Lucas Colucci
, Yoshiharu Kohayakawa
:
The mod k $k$ chromatic index of random graphs. J. Graph Theory 103(4): 767-779 (2023) - Nathan J. Bowler, Christian Elbracht
, Joshua Erde
, J. Pascal Gollin
, Karl Heuer
, Max Pitz, Maximilian Teegen
:
Ubiquity of graphs with nowhere-linear end structure. J. Graph Theory 103(3): 564-598 (2023) - Yan Cao, Guantao Chen, Xuli Qi
:
Double Vizing fans in critical class two graphs. J. Graph Theory 103(1): 48-65 (2023) - Yan Cao
, Rong Luo, Zhengke Miao, Yue Zhao:
The average degree of edge chromatic critical graphs with maximum degree seven. J. Graph Theory 103(3): 517-541 (2023) - Tsz Lung Chan, Matthias Kriesell
, Jens M. Schmidt:
Contractible edges in longest cycles. J. Graph Theory 103(3): 542-563 (2023) - Pierre Charbit, Michel Habib, Lalla Mouatadid
, Reza Naserasr
:
A new graph parameter to measure linearity. J. Graph Theory 103(3): 462-485 (2023) - Yi-ze Chen, Xin Li, Xiao-Dong Zhang
:
The extremal average distance of cubic graphs. J. Graph Theory 103(4): 713-739 (2023) - Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita:
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. J. Graph Theory 103(2): 340-358 (2023) - Eun-Kyung Cho, Ilkyoo Choi
, Boram Park:
On independent domination of regular graphs. J. Graph Theory 103(1): 159-170 (2023) - Maria Chudnovsky
, Paul D. Seymour
:
Proof of a conjecture of Plummer and Zha. J. Graph Theory 103(3): 437-450 (2023) - Hamid Reza Daneshpajouh:
A counterexample to a conjecture on the chromatic number of r $r$-stable Kneser hypergraphs. J. Graph Theory 103(4): 762-766 (2023) - James Davies:
Triangle-free graphs with large chromatic number and no induced wheel. J. Graph Theory 103(1): 112-118 (2023) - Yury Demidovich, Maksim Zhukovskii:
Tight asymptotics of clique-chromatic numbers of dense random graphs. J. Graph Theory 103(3): 451-461 (2023) - Sean Dewar
:
Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane. J. Graph Theory 103(2): 175-185 (2023) - Alberto Espuny Díaz
:
Hamiltonicity of graphs perturbed by a random geometric graph. J. Graph Theory 103(1): 12-22 (2023) - Zdenek Dvorák, Jakub Pekárek
:
Induced odd cycle packing number, independent sets, and chromatic number. J. Graph Theory 103(3): 502-516 (2023) - Carl Feghali
:
Kempe equivalence of 4-critical planar graphs. J. Graph Theory 103(1): 139-147 (2023) - Lior Gishboliner
, Michael Krivelevich
, Peleg Michaeli
:
Oriented discrepancy of Hamilton cycles. J. Graph Theory 103(4): 780-792 (2023) - Petr Gregor
, Arturo I. Merino, Torsten Mütze:
Star transposition Gray codes for multiset permutations. J. Graph Theory 103(2): 212-270 (2023) - Yangyan Gu, Xuding Zhu
:
Girth and λ $\lambda $-choosability of graphs. J. Graph Theory 103(3): 493-501 (2023) - Juan Gutiérrez
:
All longest cycles in a 2-connected partial 3-tree share a common vertex. J. Graph Theory 103(4): 690-712 (2023) - Karl Heuer
, Deniz Sarikaya
:
Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls. J. Graph Theory 103(1): 23-47 (2023) - Jamie V. de Jong
, R. Bruce Richter
:
Strong 3-Flow Conjecture for projective planar graphs. J. Graph Theory 103(4): 635-660 (2023)
skipping 16 more matches
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-06-22 12:57 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