Fábio Botler

Phablo F. S. Moura

Tássio Naia

Discret. Math., December, 2023

The mod k $k$ chromatic index of random graphs.

[BibT_eX]

[DOI]

Lucas Colucci

Yoshiharu Kohayakawa

J. Graph Theory, August, 2023

The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$.

[BibT_eX]

[DOI]

Lucas Colucci

Yoshiharu Kohayakawa

J. Graph Theory, 2023

Independent dominating sets in planar triangulations.

[BibT_eX]

[DOI]

Cristina G. Fernandes

Juan Gutiérrez

CoRR, 2023

Biclique immersions in graphs with independence number 2.

[BibT_eX]

[DOI]

A. Jiménez

Carla Negri Lintzmayer

Adrián Pastine

Daniel A. Quiroz

CoRR, 2023

Separating the edges of a graph by a linear number of paths.

[BibT_eX]

[DOI]

CoRR, 2023

On nonrepetitive colorings of cycles.

[BibT_eX]

[DOI]

Wanderson Lomenha

João Pedro de Souza

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Counting orientations of graphs with no strongly connected tournaments.

[BibT_eX]

[DOI]

Carlos Hoppen

Discret. Math., 2022

Decomposition of (2k + 1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1.

[BibT_eX]

[DOI]

Luiz Hoffmann

Discret. Math., 2022

2021

Towards Gallai's path decomposition conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

The 2-Decomposition Conjecture for a new class of graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1.

[BibT_eX]

[DOI]

Luiz Hoffmann

CoRR, 2020

Counting graph orientations with no directed triangles.

[BibT_eX]

[DOI]

Pedro Araújo

CoRR, 2020

2019

On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth.

[BibT_eX]

[DOI]

Cristina G. Fernandes

Juan Gutiérrez

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Computing the Path Number of a Graph.

[BibT_eX]

[DOI]

R. Cano

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Gallai's path decomposition conjecture for triangle-free planar graphs.

[BibT_eX]

[DOI]

Andrea Jiménez

Discret. Math., 2019

2018

Decomposing highly connected graphs into paths of length five.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

SUPERSET: A (Super)Natural Variant of the Card Game SET.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Decomposing highly edge-connected graphs into paths of any given length.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2017

Decomposition of 8-regular graphs into paths of length 4.

[BibT_eX]

[DOI]

Alexandre Talon

Electron. Notes Discret. Math., 2017

Gallai's conjecture for graphs with treewidth 3.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Decomposing regular graphs with prescribed girth into paths of given length.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Decomposing 8-regular graphs into paths of length 4.

[BibT_eX]

[DOI]

Alexandre Talon

Discret. Math., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

2015

Decompositions of highly connected graphs into paths of length five.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Decompositions of highly connected graphs into paths of any given length.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Path decompositions of regular graphs with prescribed girth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On path decompositions of 2k-regular graphs.

[BibT_eX]

[DOI]

Andrea Jiménez

Electron. Notes Discret. Math., 2015

Decompositions of triangle-free 5-regular graphs into paths of length five.

[BibT_eX]

[DOI]