scientific article; zbMATH DE number 7650943

DOI10.4230/LIPICS.STACS.2020.58MaRDI QIDQ5874335zbMATH OpenFDO

Authors Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2001.03794

zbMATH Keywords

\(k_{t,t}\)-free graphsETH lower boundsGrundy coloringhalf-graphsparameterized complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(8)

• (In)approximability of maximum minimal FVS
• Grundy coloring in some subclasses of bipartite graphs and their complements
• In)approximability of Maximum Minimal FVS
• Grundy Coloring & friends, Half-Graphs, Bicliques
• \(b\)-coloring parameterized by clique-width
• b-coloring parameterized by clique-width
• Minimum stable cut and treewidth
• \([r,s,t]\)-colorings of friendship graphs and wheels

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874335)