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 Colouring (P_r+P_s)-Free Graphs KlimosovŠ, Tereza et al. 2018
4 Colouring Square-Free Graphs without Long Induced Paths Gaspers, Serge et al. 2018
5 Disconnected Cuts in Claw-free Graphs Martin, Barnaby et al. 2018
6 On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal Dabrowski, Konrad K. et al. 2018
7 Surjective H-Colouring over Reflexive Digraphs Larose, Benoit et al. 2018
8 Clique-Width for Graph Classes Closed under Complementation Blanchť, Alexandre et al. 2017
9 Independent Feedback Vertex Set for P_5-free Graphs Bonamy, Marthe et al. 2017
10 Recognizing Graphs Close to Bipartite Graphs Bonamy, Marthe et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 17

DROPS-Home | Imprint | Privacy Published by LZI