No. Title Author Year
1 Colouring H-Free Graphs of Bounded Diameter Martin, Barnaby et al. 2019
2 Finding a Small Number of Colourful Components Bulteau, Laurent et al. 2019
3 Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271) Chudnovsky, Maria et al. 2019
4 Colouring (P_r+P_s)-Free Graphs Klimosov√°, Tereza et al. 2018
5 Colouring Square-Free Graphs without Long Induced Paths Gaspers, Serge et al. 2018
6 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
7 On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal Dabrowski, Konrad K. et al. 2018
8 Surjective H-Colouring over Reflexive Digraphs Larose, Benoit et al. 2018
9 Clique-Width for Graph Classes Closed under Complementation Blanché, Alexandre et al. 2017
10 Independent Feedback Vertex Set for P_5-free Graphs Bonamy, Marthe et al. 2017
11 Recognizing Graphs Close to Bipartite Graphs Bonamy, Marthe et al. 2017
12 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
13 Colouring Diamond-free Graphs Dabrowski, Konrad K. et al. 2016
14 Using Contracted Solution Graphs for Solving Reconfiguration Problems Bonsma, Paul et al. 2016
15 Editing to Eulerian Graphs Dabrowski, Konrad K. et al. 2014
16 Model Counting for CNF Formulas of Bounded Modular Treewidth Paulusma, Daniel et al. 2013
17 Satisfiability of Acyclic and Almost Acyclic CNF Formulas Ordyniak, Sebastian et al. 2010
18 The k-in-a-path Problem for Claw-free Graphs Fiala, Jiri et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 18


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