The following pages link to Frédéric Maffray (Q222618):
Displayed 50 items.
- Path parity and perfection (Q1356748) (← links)
- Choice number of 3-colorable elementary graphs (Q1356789) (← links)
- On planar perfectly contractile graphs (Q1359374) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- On a list-coloring problem (Q1398274) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- On the choice number of claw-free perfect graphs (Q1422425) (← links)
- On simplicial and co-simplicial vertices in graphs. (Q1428559) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Even pairs and prism corners in square-free Berge graphs (Q1748264) (← links)
- Corrigendum to: ``Even pairs and prism corners in square-free Berge graphs'' (Q1791709) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets (Q1827343) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- On dart-free perfectly contractile graphs (Q1885896) (← links)
- Split-neighbourhood graphs and the strong perfect graph conjecture (Q1892848) (← links)
- Graphs with largest number of minimum cuts (Q1917282) (← links)
- On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs (Q1924145) (← links)
- Characterization of \(b\gamma\)-perfect graphs (Q1928629) (← links)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs (Q1942664) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Cut-threshold graphs (Q2277496) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Equitable partition of graphs into induced forests (Q2342637) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Extremal graphs for a new upper bound on domination parameters in graphs (Q2433699) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- (Q2741457) (← links)
- (Q2758332) (← links)
- (Q2758333) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- On vertex b-critical trees (Q2842003) (← links)
- (Q2869313) (← links)
- (Q2906843) (← links)
- New Bounds on the Grundy Number of Products of Graphs (Q2911054) (← links)
- A Characterization of b-Perfect Graphs (Q2911056) (← links)
- Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) (← links)
- (Q3001215) (← links)
- (Q3089301) (← links)
- The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
- Odd pairs of cliques (Q3424772) (← links)
- (Q3424778) (← links)
- Coloring Meyniel graphs in linear time (Q3439304) (← links)