Cláudia Linhares Sales

Thiago Marcilon

Nicolas Nisse

Rudini M. Sampaio

Inf. Process. Lett., 2026

2025

Minimum cost flow decomposition on arc-coloured networks.

[BibT_eX]

[DOI]

Claudio Carvalho Neto

Jonas Costa Ferreira da Silva

CoRR, March, 2025

2023

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.

[BibT_eX]

[DOI]

Cláudio Carvalho

Jonas Costa Ferreira da Silva

Raul Lopes

Nicolas Nisse

Discret. Math. Theor. Comput. Sci., 2023

Semi-proper orientations of dense graphs.

[BibT_eX]

[DOI]

J. Araujo

Nicolas Nisse

Karol Suchan

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

2020

On clique-inverse graphs of graphs with bounded clique number.

[BibT_eX]

[DOI]

Liliana Alcón

Sylvain Gravier

Fábio Protti

Gabriela Ravenna

J. Graph Theory, 2020

2019

Weighted proper orientations of trees and graphs of bounded treewidth.

[BibT_eX]

[DOI]

Ignasi Sau

Theor. Comput. Sci., 2019

Minimal obstructions to 2-polar cographs.

[BibT_eX]

[DOI]

Pavol Hell

César Hernández-Cruz

Discret. Appl. Math., 2019

2017

On the b-Continuity of the Lexicographic Product of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

The b-Continuity of Graphs with Large Girth.

[BibT_eX]

[DOI]

Sebastián González Hermosillo de la Maza

Graphs Comb., 2017

Proper Orientations of Planar Bipartite Graphs.

[BibT_eX]

[DOI]

Fiachra Knox

Naoki Matsumoto

Bojan Mohar

Graphs Comb., 2017

The lexicographic product of some chordal graphs and of cographs preserves b-continuity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Proper orientation of cacti.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Graphs with large girth are b-continuous.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

b-continuity and the lexicographic product of graphs.

[BibT_eX]

[DOI]

Rafael Vargas

Electron. Notes Discret. Math., 2015

Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium.

[BibT_eX]

[DOI]

Manoel B. Campêlo

Ricardo C. Corrêa

Rudini M. Sampaio

Electron. Notes Discret. Math., 2015

2014

Maximization coloring problems on graphs with few P4.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Restricted coloring problems on Graphs with few P 4's.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

2013

A Hajós-like theorem for weighted coloring.

[BibT_eX]

[DOI]

J. Braz. Comput. Soc., 2013

Oriented trees in digraphs.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Stéphan Thomassé

Discret. Math., 2013

2012

New Bounds on the Grundy Number of Products of Graphs.

[BibT_eX]

[DOI]

András Gyárfás

J. Graph Theory, 2012

The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks.

[BibT_eX]

[DOI]

Florian Huc

Hervé Rivano

Discret. Math. Algorithms Appl., 2012

b-coloring of tight graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

On the Grundy number of graphs with few P4's.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Restricted coloring problems on graphs with few P'4s.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings

[BibT_eX]

[DOI]

CoRR, 2011

2010

Improper Coloring of Weighted Grid and Hexagonal Graphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Florian Huc

Discret. Math. Algorithms Appl., 2010

Grundy number and products of graphs.

[BibT_eX]

[DOI]

Marie Asté

Discret. Math., 2010

A bound on the treewidth of planar even-hole-free graphs.

[BibT_eX]

[DOI]

Aline Alves da Silva

Discret. Appl. Math., 2010

2009

b-coloring of m-tight graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

b-chromatic number of cacti.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Grundy number on P4-classes.

[BibT_eX]

[DOI]

Júlio César Silva Araújo

Electron. Notes Discret. Math., 2009

On minimally b-imperfect graphs.

[BibT_eX]

[DOI]

Chính T. Hoàng

Discret. Appl. Math., 2009

2008

On Planar Quasi-Parity Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Even-hole-free planar graphs have bounded treewidth.

[BibT_eX]

[DOI]

Aline Alves da Silva

Electron. Notes Discret. Math., 2008

The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks.

[BibT_eX]

[DOI]

Florian Huc

Hervé Rivano

Electron. Notes Discret. Math., 2008

2004

On dart-free perfectly contractile graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On Clique-inverse graphs of Kp-free graphs.

[BibT_eX]

[DOI]

Sylvain Gravier

Fábio Protti

Electron. Notes Discret. Math., 2004

2001

Recognizing Planar Strict Quasi-Parity Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2001

On the complexity of finding even pairs in planar perfect graphs.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Electron. Notes Discret. Math., 2001

On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs.

[BibT_eX]

[DOI]

Sylvain Gravier

Discret. Math., 2001

2000

On Dart-Free Perfectly Contractile Graphs. Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998

Even Pairs in Claw-Free Perfect Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

1997

On Planar Perfectly Contractile Graphs.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Graphs Comb., 1997

Path parity and perfection.

[BibT_eX]

[DOI]

Hazel Everett

Oscar Porto

Discret. Math., 1997

1996

Graphes parfais et paires d'amis. (Perfect graphs and even pairs).

[BibT_eX]

[DOI]