A. Lagoutte

From MaRDI portal
(Redirected from Person:267212)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Discrete Mathematics and Theoretical Computer Science. DMTCS
2024-09-06Paper
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
Discrete Applied Mathematics
2024-01-09Paper
Local certification of geometric graph classes2023-11-28Paper
On Vizing's edge colouring question
Journal of Combinatorial Theory. Series B
2023-01-04Paper
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics
2020-03-30Paper
Revisiting a theorem by Folkman on graph colouring
The Electronic Journal of Combinatorics
2020-03-30Paper
Decomposition techniques applied to the clique-stable set separation problem
Discrete Mathematics
2018-04-05Paper
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
The Electronic Journal of Combinatorics
2017-07-26Paper
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
The Electronic Journal of Combinatorics
2017-07-26Paper
Colouring perfect graphs with bounded clique number
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Clique-stable set separation in perfect graphs with no balanced skew-partitions
Discrete Mathematics
2016-04-08Paper
Identifying codes in hereditary classes of graphs and VC-dimension
SIAM Journal on Discrete Mathematics
2015-10-30Paper
Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
Discrete Mathematics
2015-10-08Paper
The Erdős-Hajnal conjecture for paths and antipaths
Journal of Combinatorial Theory. Series B
2015-06-10Paper
Clique versus independent set
European Journal of Combinatorics
2014-08-28Paper
Flooding games on graphs
Discrete Applied Mathematics
2014-05-05Paper
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters2013-09-02Paper
Survey: Weighted extended top-down tree transducers. III. Composition
Algebraic Foundations in Computer Science
2011-11-11Paper
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: A. Lagoutte