default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaycon Sambinelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]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)- [j10]Fábio Botler, Andrea Jiménez
, Maycon Sambinelli, Yoshiko Wakabayashi:
On the Structure of a Smallest Counterexample and a New Class Verifying the 2-Decomposition Conjecture. Graphs Comb. 40(5): 102 (2024) - 2023
- [i5]Fábio Botler, Andrea Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel A. Quiroz, Maycon Sambinelli:
Biclique immersions in graphs with independence number 2. CoRR abs/2303.06483 (2023) - [i4]Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer, Martín Matamala, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Yoshiko Wakabayashi, Weiqiang Yu, José Zamora:
Boundedness for proper conflict-free and odd colorings. CoRR abs/2308.00170 (2023) - 2022
- [j9]Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
α-Diperfect digraphs. Discret. Math. 345(5): 112759 (2022) - 2021
- [j8]Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli:
Decomposing split graphs into locally irregular graphs. Discret. Appl. Math. 292: 33-44 (2021) - [j7]Fábio Botler, Maycon Sambinelli:
Towards Gallai's path decomposition conjecture. J. Graph Theory 97(1): 161-184 (2021) - [c4]Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi:
The 2-Decomposition Conjecture for a new class of graphs. LAGOS 2021: 359-367 - 2020
- [j6]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)
2010 – 2019
- 2019
- [j5]Fábio Botler, Andrea Jiménez, Maycon Sambinelli:
Gallai's path decomposition conjecture for triangle-free planar graphs. Discret. Math. 342(5): 1403-1414 (2019) - [j4]Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva, Orlando Lee:
Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs. Graphs Comb. 35(4): 921-931 (2019) - [c3]Fábio Botler, R. Cano, Maycon Sambinelli:
On Computing the Path Number of a Graph. LAGOS 2019: 185-197 - [c2]Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli:
Decomposing Split Graphs into Locally Irregular Graphs. LAGOS 2019: 603-612 - [c1]Lucas R. Yoshimura, Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
Linial's Conjecture for Arc-spine Digraphs. LAGOS 2019: 735-746 - [i3]Fábio Botler, Maycon Sambinelli:
Towards Gallai's path decomposition conjecture. CoRR abs/1911.04546 (2019) - 2018
- [i2]Fábio Botler, Andrea Jiménez, Maycon Sambinelli:
Gallai's path decomposition conjecture for triangle-free planar graphs. CoRR abs/1803.06768 (2018) - 2017
- [j3]Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
On Linial's conjecture for spine digraphs. Discret. Math. 340(5): 851-854 (2017) - [j2]Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs. Electron. Notes Discret. Math. 62: 111-116 (2017) - [j1]Fábio Botler, Maycon Sambinelli:
Gallai's conjecture for graphs with treewidth 3. Electron. Notes Discret. Math. 62: 147-152 (2017) - [i1]Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee:
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. CoRR abs/1706.04334 (2017)
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-04 21:00 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:
