No. Title Author Year
1 Colouring Square-Free Graphs without Long Induced Paths Gaspers, Serge et al. 2018
2 Surjective H-Colouring over Reflexive Digraphs Larose, Benoit et al. 2018
3 Clique-Width for Graph Classes Closed under Complementation Blanchť, Alexandre et al. 2017
4 Independent Feedback Vertex Set for P_5-free Graphs Bonamy, Marthe et al. 2017
5 Recognizing Graphs Close to Bipartite Graphs Bonamy, Marthe et al. 2017
6 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
7 Colouring Diamond-free Graphs Dabrowski, Konrad K. et al. 2016
8 Using Contracted Solution Graphs for Solving Reconfiguration Problems Bonsma, Paul et al. 2016
9 Editing to Eulerian Graphs Dabrowski, Konrad K. et al. 2014
10 Model Counting for CNF Formulas of Bounded Modular Treewidth Paulusma, Daniel et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint Published by LZI