No. Title Author Year
1 Finding a Small Number of Colourful Components Bulteau, Laurent et al. 2019
2 Colouring (P_r+P_s)-Free Graphs Klimosová, Tereza et al. 2018
3 Colouring Square-Free Graphs without Long Induced Paths Gaspers, Serge et al. 2018
4 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
5 On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal Dabrowski, Konrad K. et al. 2018
6 Surjective H-Colouring over Reflexive Digraphs Larose, Benoit et al. 2018
7 Clique-Width for Graph Classes Closed under Complementation Blanché, Alexandre et al. 2017
8 Independent Feedback Vertex Set for P_5-free Graphs Bonamy, Marthe et al. 2017
9 Recognizing Graphs Close to Bipartite Graphs Bonamy, Marthe et al. 2017
10 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 16

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