Arnaud Pêcher

Eur. J. Comb., 2021

On the density of sets of the Euclidean plane avoiding distance 1.

[BibT_eX]

[DOI]

Thomas Bellitto

Antoine Sédillot

Discret. Math. Theor. Comput. Sci., 2021

2019

On the Density of Sets Avoiding Parallelohedron Distance 1.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

2014

Computing the clique number of <i>a</i>a-perfect graphs in polynomial time.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Strong chromatic index of planar graphs with large girth.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

2013

Computing clique and chromatic number of circular-perfect graphs in polynomial time.

[BibT_eX]

[DOI]

Math. Program., 2013

On the theta number of powers of cycle graphs.

[BibT_eX]

[DOI]

Christine Bachoc

Alain Thiéry

Comb., 2013

2012

Polynomial time computability of some graph parameters for superclasses of perfect graphs.

[BibT_eX]

[DOI]

Int. J. Math. Oper. Res., 2012

2011

Computing the clique number of a-perfect graphs in polynomial time.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Clique and chromatic number of circular-perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

MPQ-trees for orthogonal packing problem.

[BibT_eX]

[DOI]

Cédric Joncour

Petru Valicov

Electron. Notes Discret. Math., 2010

Consecutive ones matrices for multi-dimensional orthogonal packing problems.

[BibT_eX]

[DOI]

Cédric Joncour

Electron. Notes Discret. Math., 2010

On facets of stable set polytopes of claw-free graphs with stability number 3.

[BibT_eX]

[DOI]

Discret. Math., 2010

Decomposition of sparse graphs, with application to game coloring number.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Characterizing and bounding the imperfection ratio for some classes of graphs.

[BibT_eX]

[DOI]

Sylvain Coulonges

Math. Program., 2009

On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Triangle-free strongly circular-perfect graphs.

[BibT_eX]

[DOI]

Sylvain Coulonges

Discret. Math., 2009

2008

On classes of minimal circular-imperfect graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Des multiples facettes des graphes circulants.

[BibT_eX]

[DOI]

, 2008

2007

A note on the Chvátal-rank of clique family inequalities.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2007

Claw-free circular-perfect graphs.

[BibT_eX]

[DOI]

Xuding Zhu

Electron. Notes Discret. Math., 2007

On facets of stable set polytopes of claw-free graphs with stability number three.

[BibT_eX]

[DOI]

Pierre Pesneau

Electron. Notes Discret. Math., 2007

2006

Almost all webs are not rank-perfect.

[BibT_eX]

[DOI]

Math. Program., 2006

On the circular chromatic number of circular partitionable graphs.

[BibT_eX]

[DOI]

Xuding Zhu

J. Graph Theory, 2006

Generalized clique family inequalities for claw-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

A construction for non-rank facets of stable set polytopes of webs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

On non-rank facets of stable set polytopes of webs with clique number four.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Three classes of minimal circular-imperfect graphs.

[BibT_eX]

[DOI]

Xuding Zhu

Electron. Notes Discret. Math., 2005

On strongly circular-perfectness.

[BibT_eX]

[DOI]

Sylvain Coulonges

Electron. Notes Discret. Math., 2005

2004

Cayley partitionable graphs and near-factorizations of finite groups.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Partitionable graphs arising from near-factorizations of finite groups.

[BibT_eX]

[DOI]