Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

Obstructions to partitions of chordal graphs

Tomás Feder, Pavol Hell and Shekoofeh Nekooei Rizi
Discrete Mathematics 313 (19) 1861 (2013)
DOI: 10.1016/j.disc.2012.05.023
See this article

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science

Herbert Fleischner, Egbert Mujuni, Daniel Paulusma and Stefan Szeider
Lecture Notes in Computer Science, FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 4855 340 (2007)
DOI: 10.1007/978-3-540-77050-3_28
See this article

Graph partitions with prescribed patterns

Pavol Hell
European Journal of Combinatorics 35 335 (2014)
DOI: 10.1016/j.ejc.2013.06.043
See this article

Covering graphs with few complete bipartite subgraphs

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma and Stefan Szeider
Theoretical Computer Science 410 (21-23) 2045 (2009)
DOI: 10.1016/j.tcs.2008.12.059
See this article

The external constraint 4 nonempty part sandwich problem

Rafael B. Teixeira, Simone Dantas and Celina M.H. de Figueiredo
Discrete Applied Mathematics 159 (7) 661 (2011)
DOI: 10.1016/j.dam.2010.03.015
See this article

On disconnected cuts and separators

Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
Discrete Applied Mathematics 159 (13) 1345 (2011)
DOI: 10.1016/j.dam.2011.04.027
See this article

2K2 vertex-set partition into nonempty parts

Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M.H. de Figueiredo and Sulamita Klein
Electronic Notes in Discrete Mathematics 30 291 (2008)
DOI: 10.1016/j.endm.2008.01.050
See this article

Partitioning Chordal Graphs

Tomás Feder, Pavol Hell and Shekoofeh Nekooei Rizi
Electronic Notes in Discrete Mathematics 38 325 (2011)
DOI: 10.1016/j.endm.2011.09.053
See this article

The polynomial dichotomy for three nonempty part sandwich problems

Rafael B. Teixeira, Simone Dantas and Celina M.H. de Figueiredo
Discrete Applied Mathematics 158 (12) 1286 (2010)
DOI: 10.1016/j.dam.2009.12.002
See this article

The complexity of surjective homomorphism problems—a survey

Manuel Bodirsky, Jan Kára and Barnaby Martin
Discrete Applied Mathematics 160 (12) 1680 (2012)
DOI: 10.1016/j.dam.2012.03.029
See this article

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk
SIAM Journal on Computing 41 (4) 815 (2012)
DOI: 10.1137/110826813
See this article

The computational complexity of disconnected cut and 2K2-partition

Barnaby Martin and Daniël Paulusma
Journal of Combinatorial Theory, Series B 111 17 (2015)
DOI: 10.1016/j.jctb.2014.09.002
See this article

2K2 vertex-set partition into nonempty parts

Kathryn Cook, Simone Dantas, Elaine M. Eschen, et al.
Discrete Mathematics 310 (6-7) 1259 (2010)
DOI: 10.1016/j.disc.2009.11.030
See this article

Computing vertex-surjective homomorphisms to partially reflexive trees

Petr A. Golovach, Daniël Paulusma and Jian Song
Theoretical Computer Science 457 86 (2012)
DOI: 10.1016/j.tcs.2012.06.039
See this article

Parameterizing cut sets in a graph by the number of their components

Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
Theoretical Computer Science 412 (45) 6340 (2011)
DOI: 10.1016/j.tcs.2011.07.005
See this article

Matrix Partitions with Finitely Many Obstructions

Tomás Feder, Pavol Hell and Wing Xie
Electronic Notes in Discrete Mathematics 28 371 (2007)
DOI: 10.1016/j.endm.2007.01.057
See this article

The polynomial dichotomy for three nonempty part sandwich problems

Rafael B. Teixeira, Simone Dantas and Celina M.H. de Figueiredo
Electronic Notes in Discrete Mathematics 30 81 (2008)
DOI: 10.1016/j.endm.2008.01.015
See this article

2K2-partition of some classes of graphs

Simone Dantas, Frédéric Maffray and Ana Silva
Discrete Applied Mathematics 160 (18) 2662 (2012)
DOI: 10.1016/j.dam.2010.09.009
See this article

The P versus NP–complete dichotomy of some challenging problems in graph theory

Celina M.H. de Figueiredo
Discrete Applied Mathematics 160 (18) 2681 (2012)
DOI: 10.1016/j.dam.2010.12.014
See this article

The Complexity of the List Partition Problem for Graphs

Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng and R. Sritharan
SIAM Journal on Discrete Mathematics 21 (4) 900 (2008)
DOI: 10.1137/060666238
See this article

Computer Science – Theory and Applications

Petr A. Golovach, Daniël Paulusma and Jian Song
Lecture Notes in Computer Science, Computer Science – Theory and Applications 6651 261 (2011)
DOI: 10.1007/978-3-642-20712-9_20
See this article

Algorithms and Computation

Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
Lecture Notes in Computer Science, Algorithms and Computation 5878 605 (2009)
DOI: 10.1007/978-3-642-10631-6_62
See this article

Principles and Practice of Constraint Programming – CP 2011

Barnaby Martin and Daniël Paulusma
Lecture Notes in Computer Science, Principles and Practice of Constraint Programming – CP 2011 6876 561 (2011)
DOI: 10.1007/978-3-642-23786-7_43
See this article

Disconnected cuts in claw-free graphs

Barnaby Martin, Daniël Paulusma and Erik Jan van Leeuwen
Journal of Computer and System Sciences 113 60 (2020)
DOI: 10.1016/j.jcss.2020.04.005
See this article