The following pages link to Arnaud Pêcher (Q378132):
Displayed 35 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number 3 (Q960958) (← links)
- Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Partitionable graphs arising from near-factorizations of finite groups (Q1402077) (← links)
- Polynomial time computability of some graph parameters for superclasses of perfect graphs (Q1758876) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- On the density of sets avoiding parallelohedron distance 1 (Q2324626) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- (Q2857431) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- A note on the Chvátal-rank of clique family inequalities (Q3004203) (← links)
- On strongly circular-perfectness (Q3439367) (← links)
- Generalized clique family inequalities for claw-free graphs (Q3439487) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number three (Q3439583) (← links)
- Three classes of minimal circular-imperfect graphs (Q3439655) (← links)
- On the density of sets of the Euclidean plane avoiding distance 1 (Q5038188) (← links)
- Beyond Perfection: Computational Results for Superclasses (Q5265167) (← links)
- (Q5419976) (← links)
- On the circular chromatic number of circular partitionable graphs (Q5486280) (← links)
- (Q5708546) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
- Claw-free circular-perfect graphs (Q5900081) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)