Source: OpenCitations

• Bipartizing with a Matching

  Lecture notes in computer science

  Authors : Carlos V. G. C. Lima , Dieter Rautenbach , Uéverton S. Souza , Jayme L. Szwarcfiter

  Journal reference : Volume , 2018, pp. 198-213

  DOI : 10.1007/978-3-030-04651-4_14

• Bounding the clique-width of H -free split graphs

  Discrete Applied Mathematics

  Authors : Andreas Brandstädt, Konrad K. Dabrowski , Shenwei Huang , Daniël Paulusma

  Journal reference : Volume 211, 2016, pp. 30-39

  DOI : 10.1016/j.dam.2016.04.003

• Labelled Induced Subgraphs and Well-Quasi-Ordering

  Order

  Authors : Aistis Atminas , Vadim V. Lozin

  Journal reference : Volume 32, 2014, pp. 313-328

  DOI : 10.1007/s11083-014-9333-9

• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

  Durham Research Online (Durham University)

  Authors : Petr A. Golovach , Matthew Johnson , Daniël Paulusma , Jian Song

  Journal reference : Volume 84, 2016, pp. 331-363

  DOI : 10.1002/jgt.22028

• 4-coloring (P6,bull) -free graphs

  Discrete Applied Mathematics

  Authors : Frédéric Maffray , Lucas Pastor

  Journal reference : Volume 231, 2016, pp. 198-210

  DOI : 10.1016/j.dam.2016.03.011

• Colouring vertices of triangle-free graphs without forests

  Discrete Mathematics

  Authors : Konrad K. Dabrowski , Vadim Lozin , Rajiv Raman, Bernard Ries

  Journal reference : Volume 312, 2012, pp. 1372-1385

  DOI : 10.1016/j.disc.2011.12.012

• Triangle-free graphs with no six-vertex induced path

  UWSpace (University of Waterloo)

  Authors : Maria Chudnovsky , Paul Seymour , Sophie Spirkl , Mingxian Zhong

  Journal reference : Volume 341, 2018, pp. 2179-2196

  DOI : 10.1016/j.disc.2018.04.020

• Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs

  Durham Research Online (Durham University)

  Authors : Shenwei Huang , Matthew Johnson , Daniël Paulusma

  Journal reference : Volume , 2014, pp. 162-173

  DOI : 10.1007/978-3-319-07956-1_15

• Coloring graphs without short cycles and long induced paths

  Discrete Applied Mathematics

  Authors : Petr A. Golovach , Daniël Paulusma , Jian Song

  Journal reference : Volume 167, 2014, pp. 107-120

  DOI : 10.1016/j.dam.2013.12.008

• The optimal χ-bound for (P7,C4,C5)-free graphs

  Discrete Mathematics

  Authors : Shenwei Huang

  Journal reference : Volume 347, 2024, pp. 114036

  DOI : 10.1016/j.disc.2024.114036

• Bounding the mim‐width of hereditary graph classes

  arXiv (Cornell University)

  Authors : Nick Brettell , Jake Horsfield , Andrea Munaro , Giacomo Paesani , Daniël Paulusma

  Journal reference : Volume 99, 2021, pp. 117-151

  DOI : 10.1002/jgt.22730

• Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs

  Durham Research Online (Durham University)

  Authors : Shenwei Huang , Matthew Johnson , Daniël Paulusma

  Journal reference : Volume 58, 2015, pp. 3074-3088

  DOI : 10.1093/comjnl/bxv039

• Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs

  Durham Research Online (Durham University)

  Authors : Konrad K. Dabrowski , Daniël Paulusma

  Journal reference : Volume 59, 2015, pp. 650-666

  DOI : 10.1093/comjnl/bxv096

• Open Problems on Graph Coloring for Special Graph Classes

  Durham Research Online (Durham University)

  Authors : Daniël Paulusma

  Journal reference : Volume , 2016, pp. 16-30

  DOI : 10.1007/978-3-662-53174-7_2

• Clique-Width for Graph Classes Closed under Complementation

  arXiv (Cornell University)

  Authors : Alexandre Blanché , Konrad K. Dabrowski , Matthew Johnson , Vadim V. Lozin , Daniël Paulusma , Viktor Zamaraev

  Journal reference : Volume 34, 2020, pp. 1107-1147

  DOI : 10.1137/18m1235016

• On the computational complexity of the bipartizing matching problem

  arXiv (Cornell University)

  Authors : Carlos V. G. C. Lima , Dieter Rautenbach , Uéverton S. Souza , Jayme L. Szwarcfiter

  Journal reference : Volume 316, 2021, pp. 1235-1256

  DOI : 10.1007/s10479-021-03966-9

• Clique-Width: Harnessing the Power of Atoms

  Durham Research Online (Durham University)

  Authors : Konrad K. Dabrowski , Tomáš Masařík , Jana Novotná, Daniël Paulusma , Paweł Rzążewski

  Journal reference : Volume , 2020, pp. 119-133

  DOI : 10.1007/978-3-030-60440-0_10

• Colouring square-free graphs without long induced paths

  Journal of Computer and System Sciences

  Authors : Serge Gaspers , Shenwei Huang , Daniël Paulusma

  Journal reference : Volume 106, 2019, pp. 60-79

  DOI : 10.1016/j.jcss.2019.06.002

• Colouring Vertices of Triangle-Free Graphs

  Lecture notes in computer science

  Authors : Konrad Dabrowski , Vadim Lozin , Rajiv Raman, Bernard Ries

  Journal reference : Volume , 2010, pp. 184-195

  DOI : 10.1007/978-3-642-16926-7_18

• The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes

  Authors : Guillaume Ducoffe , Alexandru Popa

  Journal reference : Volume 291, 2020, pp. 201-222

  DOI : 10.1016/j.dam.2020.12.018

• Recent developments on graphs of bounded clique-width

  Discrete Applied Mathematics

  Authors : Marcin Kamiński , Vadim V. Lozin , Martin Milanič

  Journal reference : Volume 157, 2008, pp. 2747-2761

  DOI : 10.1016/j.dam.2008.08.022

• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs

  Lecture notes in computer science

  Authors : Frédéric Maffray , Lucas Pastor

  Journal reference : Volume , 2016, pp. 85-96

  DOI : 10.1007/978-3-662-53536-3_8

• List coloring in the absence of two subgraphs

  Durham Research Online (Durham University)

  Authors : Petr A. Golovach , Daniël Paulusma

  Journal reference : Volume 166, 2013, pp. 123-130

  DOI : 10.1016/j.dam.2013.10.010

• A new characterization of P6 -free graphs

  Discrete Applied Mathematics

  Authors : Pim van ’t Hof , Daniël Paulusma

  Journal reference : Volume 158, 2008, pp. 731-740

  DOI : 10.1016/j.dam.2008.08.025