The following pages link to Frédéric Maffray (Q222618):
Displayed 50 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- Even pairs in square-free Berge graphs (Q322216) (← links)
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
- Fast recognition of doubled graphs (Q385965) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- On edge-\(b\)-critical graphs (Q476322) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- Long induced paths in graphs (Q518170) (← links)
- Small feedback vertex sets in planar digraphs (Q528978) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- On average lower independence and domination numbers in graphs (Q556830) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- Dominator colorings in some classes of graphs (Q659760) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Preperfect graphs (Q684406) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- Small step-dominating sets in trees (Q870988) (← links)
- Kernels in perfect line-graphs (Q908943) (← links)
- Completely separable graphs (Q908944) (← links)
- Extremal perfect graphs for a bound on the domination number (Q952634) (← links)
- On minimally \(b\)-imperfect graphs (Q967413) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- On \(b\)-colorings in regular graphs (Q1026139) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On b-perfect chordal graphs (Q1043818) (← links)
- (Q1092927) (redirect page) (← links)
- On a relationship between Hadwiger and stability numbers (Q1092928) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- Antitwins in partitionable graphs (Q1210574) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- Some operations preserving the existence of kernels (Q1301845) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- Linear recognition of pseudo-split graphs (Q1331889) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Coloring perfect degenerate graphs (Q1356545) (← links)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685) (← links)