default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Kabela
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Adam Kabela, Zdenek Ryjácek
, Mária Skyvová, Petr Vrána:
A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs. Discret. Math. 347(11): 114154 (2024)- 2023
- [j15]Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108: 103632 (2023) - [j14]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. Math. Comput. 93(345): 443-458 (2023) - [c1]Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr:
Improved Bounds for the Binary Paint Shop Problem. COCOON (2) 2023: 210-221 - 2022
- [j13]Maria Chudnovsky, Adam Kabela, Binlong Li, Petr Vrána:
Forbidden Induced Pairs for Perfectness and $\omega$-Colourability of Graphs. Electron. J. Comb. 29(2) (2022) - [j12]Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron:
Density Maximizers of Layered Permutations. Electron. J. Comb. 29(3) (2022) - [j11]Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345(6): 112837 (2022) - [j10]Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Král':
Packing and covering directed triangles asymptotically. Eur. J. Comb. 101: 103462 (2022) - [i2]Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron:
The smallest 5-chromatic tournament. CoRR abs/2210.09936 (2022) - 2021
- [j9]Adam Kabela, Jakub Teska:
Trestles in the squares of graphs. Discret. Math. 344(11): 112532 (2021) - [j8]Pablo Candela, Carlos Catalá, Robert Hancock, Adam Kabela, Daniel Král', Ander Lamaison, Lluís Vena:
Coloring graphs by translates in the circle. Eur. J. Comb. 96: 103346 (2021)
2010 – 2019
- 2019
- [j7]Adam Kabela:
Long paths and toughness of k-trees and chordal planar graphs. Discret. Math. 342(1): 55-63 (2019) - [j6]Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
On forbidden induced subgraphs for K1, 3-free perfect graphs. Discret. Math. 342(6): 1602-1608 (2019) - [i1]Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. CoRR abs/1912.04243 (2019) - 2018
- [j5]Adam Kabela:
An update on non-Hamiltonian 54-tough maximal planar graphs. Discret. Math. 341(3): 579-587 (2018) - [j4]Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska:
Bounding the distance among longest paths in a connected graph. Discret. Math. 341(4): 1155-1159 (2018) - [j3]Zdenek Dvorák, Adam Kabela, Tomás Kaiser:
Planar graphs have two-coloring number at most 8. J. Comb. Theory B 130: 144-157 (2018) - 2017
- [j2]Adam Kabela, Tomás Kaiser:
10-tough chordal graphs are Hamiltonian. J. Comb. Theory B 122: 417-427 (2017) - 2015
- [j1]Adam Kabela, Tomás Kaiser:
10-tough chordal graphs are hamiltonian (Extended Abstract). Electron. Notes Discret. Math. 49: 331-336 (2015)
Coauthor Index
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.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
