Maycon Sambinelli

Orcid: 0000-0003-1381-4794

According to our database1, Maycon Sambinelli authored at least 15 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Boundedness for proper conflict-free and odd colorings.
CoRR, 2023

Biclique immersions in graphs with independence number 2.
CoRR, 2023

2022
<i>α</i>-Diperfect digraphs.
Discret. Math., 2022

2021
Towards Gallai's path decomposition conjecture.
J. Graph Theory, 2021

The 2-Decomposition Conjecture for a new class of graphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Gallai's path decomposition conjecture for graphs with treewidth at most 3.
J. Graph Theory, 2020

2019
Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs.
Graphs Comb., 2019

Linial's Conjecture for Arc-spine Digraphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Decomposing Split Graphs into Locally Irregular Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Computing the Path Number of a Graph.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Gallai's path decomposition conjecture for triangle-free planar graphs.
Discret. Math., 2019

2017
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs.
Electron. Notes Discret. Math., 2017

Gallai's conjecture for graphs with treewidth 3.
Electron. Notes Discret. Math., 2017

On Linial's conjecture for spine digraphs.
Discret. Math., 2017

On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3.
CoRR, 2017


  Loading...