No. Title Author Year
1 On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs Dyrseth, Jakob et al. 2022
2 Reducing the Vertex Cover Number via Edge Contractions Lima, Paloma T. et al. 2022
3 Taming Graphs with No Large Creatures and Skinny Ladders Gajarsk√Ĺ, Jakub et al. 2022
4 XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure Bodlaender, Hans L. et al. 2022
5 b-Coloring Parameterized by Clique-Width Jaffke, Lars et al. 2021
6 Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes Lima, Paloma T. et al. 2020
7 Reducing Graph Transversals via Edge Contractions Lima, Paloma T. et al. 2020
8 Structural Parameterizations of Clique Coloring Jaffke, Lars et al. 2020
9 A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs Jaffke, Lars et al. 2019
10 Blocking Dominating Sets for H-Free Graphs via Edge Contractions Galby, Esther et al. 2019
11 Reducing the Domination Number of Graphs via Edge Contractions Galby, Esther et al. 2019
12 Finding Connected Secluded Subgraphs Golovach, Petr A. et al. 2018
13 Parameterized Aspects of Strong Subgraph Closure Golovach, Petr A. et al. 2018
14 Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs Heggernes, Pinar et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI