default search action
Fábio Botler
Person information
- affiliation: University of Sao Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j25]Fábio Botler
, Wanderson Lomenha, João Pedro de Souza:
On nonrepetitive colorings of paths and cycles. Discret. Appl. Math. 360: 221-228 (2025) - 2024
- [j24]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
Independent Dominating Sets in Planar Triangulations. Electron. J. Comb. 31(2) (2024) - [j23]Fábio Botler, Andrea Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel Quiroz, Maycon Sambinelli:
Biclique immersions in graphs with independence number 2. Eur. J. Comb. 122: 104042 (2024) - [j22]Fábio Botler, Andrea Jiménez
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture. Graphs Comb. 40(5): 102 (2024) - [i13]Fábio Botler, Tássio Naia:
Separating the edges of a graph by cycles and by subdivisions of K4. CoRR abs/2407.02102 (2024) - 2023
- [j21]Fábio Botler
Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs. Discret. Math. 346(12): 113583 (2023) - [j20]Fábio Botler
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. J. Graph Theory 102(1): 197-200 (2023) - [j19]Fábio Botler
The mod k $k$ chromatic index of random graphs. J. Graph Theory 103(4): 767-779 (2023) - [c6]Fábio Botler
On nonrepetitive colorings of cycles. LAGOS 2023: 302-307 - [i12]Marthe Bonamy, Fábio Botler
Separating the edges of a graph by a linear number of paths. CoRR abs/2301.08707 (2023) - [i11]Fábio Botler
Biclique immersions in graphs with independence number 2. CoRR abs/2303.06483 (2023) - [i10]Fábio Botler
Independent dominating sets in planar triangulations. CoRR abs/2308.02754 (2023) - 2022
- [j18]Fábio Botler
Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1. Discret. Math. 345(8): 112906 (2022) - [j17]Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. Discret. Math. 345(12): 113024 (2022) - 2021
- [j16]Fábio Botler
On Tuza's conjecture for triangulations and graphs with small treewidth. Discret. Math. 344(4): 112281 (2021) - [j15]Fábio Botler
Towards Gallai's path decomposition conjecture. J. Graph Theory 97(1): 161-184 (2021) - [c5]Fábio Botler
The 2-Decomposition Conjecture for a new class of graphs. LAGOS 2021: 359-367 - [c4]Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. LAGOS 2021: 385-393 - [i9]Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota:
Counting orientations of graphs with no strongly connected tournaments. CoRR abs/2101.12327 (2021) - 2020
- [j14]Fábio Botler
Gallai's path decomposition conjecture for graphs with treewidth at most 3. J. Graph Theory 93(3): 328-349 (2020) - [i8]Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez:
On Tuza's conjecture for triangulations and graphs with small treewidth. CoRR abs/2002.07925 (2020) - [i7]Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota:
Counting graph orientations with no directed triangles. CoRR abs/2005.13091 (2020) - [i6]Fábio Botler, Luiz Hoffmann:
Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1. CoRR abs/2012.05145 (2020)
2010 – 2019
- 2019
- [j13]Fábio Botler
Gallai's path decomposition conjecture for triangle-free planar graphs. Discret. Math. 342(5): 1403-1414 (2019) - [c3]Fábio Botler
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. LAGOS 2019: 171-183 - [c2]Fábio Botler
On Computing the Path Number of a Graph. LAGOS 2019: 185-197 - [i5]Fábio Botler, Maycon Sambinelli:
Towards Gallai's path decomposition conjecture. CoRR abs/1911.04546 (2019) - 2018
- [j12]Fábio Botler
Decomposing highly connected graphs into paths of length five. Discret. Appl. Math. 245: 128-138 (2018) - [c1]Fábio Botler
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN 2018: 12:1-12:17 - [i4]Fábio Botler, Andrea Jiménez, Maycon Sambinelli:
Gallai's path decomposition conjecture for triangle-free planar graphs. CoRR abs/1803.06768 (2018) - 2017
- [j11]Fábio Botler
On path decompositions of 2k-regular graphs. Discret. Math. 340(6): 1405-1411 (2017) - [j10]Fábio Botler
Decomposing 8-regular graphs into paths of length 4. Discret. Math. 340(9): 2275-2285 (2017) - [j9]Fábio Botler
Decomposing regular graphs with prescribed girth into paths of given length. Eur. J. Comb. 66: 28-36 (2017) - [j8]Fábio Botler
Decomposition of 8-regular graphs into paths of length 4. Electron. Notes Discret. Math. 61: 147-153 (2017) - [j7]Fábio Botler
Gallai's conjecture for graphs with treewidth 3. Electron. Notes Discret. Math. 62: 147-152 (2017) - [j6]Fábio Botler
Decomposing highly edge-connected graphs into paths of any given length. J. Comb. Theory B 122: 508-542 (2017) - [i3]Fábio Botler, Maycon Sambinelli
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. CoRR abs/1706.04334 (2017) - 2016
- [i2]Fábio Botler, Alexandre Talon:
Decomposing 8-regular graphs into paths of length 4. CoRR abs/1607.01456 (2016) - 2015
- [j5]Fábio Botler
Decompositions of triangle-free 5-regular graphs into paths of length five. Discret. Math. 338(11): 1845-1855 (2015) - [j4]Fábio Botler
Path decompositions of regular graphs with prescribed girth. Electron. Notes Discret. Math. 49: 629-636 (2015) - [j3]Fábio Botler
Decompositions of highly connected graphs into paths of any given length. Electron. Notes Discret. Math. 49: 795-802 (2015) - [j2]Fábio Botler
On path decompositions of 2k-regular graphs. Electron. Notes Discret. Math. 50: 163-168 (2015) - [j1]Fábio Botler
Decompositions of highly connected graphs into paths of length five. Electron. Notes Discret. Math. 50: 211-216 (2015) - [i1]Fábio Botler, Andrea Jiménez:
On path decompositions of 2k-regular graphs. CoRR abs/1510.02526 (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-10-23 20:31 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: