The following pages link to Aurélie Lagoutte (Q267212):
Displaying 16 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- (Q402463) (redirect page) (← links)
- Clique versus independent set (Q402465) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Revisiting a theorem by Folkman on graph colouring (Q2309226) (← links)
- The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- Flooding games on graphs (Q2448890) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition (Q3098043) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly (Q6505226) (← links)
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly (Q6599810) (← links)
