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):

Computational properties of argument systems satisfying graph-theoretic constraints

Paul E. Dunne
Artificial Intelligence 171 (10-15) 701 (2007)
DOI: 10.1016/j.artint.2007.03.006
See this article

Complexity and approximation of the Constrained Forest problem

Cristina Bazgan, Basile Couëtoux and Zsolt Tuza
Theoretical Computer Science 412 (32) 4081 (2011)
DOI: 10.1016/j.tcs.2010.07.018
See this article

Partitioning a graph into disjoint cliques and a triangle-free graph

Faisal N. Abu-Khzam, Carl Feghali and Haiko Müller
Discrete Applied Mathematics 190-191 1 (2015)
DOI: 10.1016/j.dam.2015.03.015
See this article

Linear kernels for k-tuple and liar’s domination in bounded genus graphs

Arijit Bishnu, Arijit Ghosh and Subhabrata Paul
Discrete Applied Mathematics (2016)
DOI: 10.1016/j.dam.2016.06.008
See this article

The monadic second order logic of graphs VI: on several representations of graphs by relational structures

Bruno Courcelle
Discrete Applied Mathematics 54 (2-3) 117 (1994)
DOI: 10.1016/0166-218X(94)90019-1
See this article

Automata for the verification of monadic second-order graph properties

Bruno Courcelle and Irène Durand
Journal of Applied Logic 10 (4) 368 (2012)
DOI: 10.1016/j.jal.2011.07.001
See this article

Characterization and complexity of uniformly nonprimitive labeled 2-structures

J. Engelfriet, T. Harju, A. Proskurowski and G. Rozenberg
Theoretical Computer Science 154 (2) 247 (1996)
DOI: 10.1016/0304-3975(94)00272-X
See this article

The relative clique-width of a graph

Vadim Lozin and Dieter Rautenbach
Journal of Combinatorial Theory, Series B 97 (5) 846 (2007)
DOI: 10.1016/j.jctb.2007.04.001
See this article

Treewidth and logical definability of graph products

Selma Djelloul
Theoretical Computer Science 410 (8-10) 696 (2009)
DOI: 10.1016/j.tcs.2008.10.019
See this article

Computing square roots of graphs with low maximum degree

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, et al.
Discrete Applied Mathematics (2017)
DOI: 10.1016/j.dam.2017.04.041
See this article

Modifying a Graph Using Vertex Elimination

Petr A. Golovach, Pinar Heggernes, Pim van ’t Hof, et al.
Algorithmica 72 (1) 99 (2015)
DOI: 10.1007/s00453-013-9848-2
See this article

A linear kernel for finding square roots of almost planar graphs

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma and Anthony Stewart
Theoretical Computer Science (2017)
DOI: 10.1016/j.tcs.2017.05.008
See this article

MSOL partitioning problems on graphs of bounded treewidth and clique-width

Michaël Rao
Theoretical Computer Science 377 (1-3) 260 (2007)
DOI: 10.1016/j.tcs.2007.03.043
See this article

Uniform Kernelization Complexity of Hitting Forbidden Minors

Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov and Saket Saurabh
ACM Transactions on Algorithms 13 (3) 1 (2017)
DOI: 10.1145/3029051
See this article

Degree-constrained decompositions of graphs: Bounded treewidth and planarity

Cristina Bazgan, Zsolt Tuza and Daniel Vanderpooten
Theoretical Computer Science 355 (3) 389 (2006)
DOI: 10.1016/j.tcs.2006.01.024
See this article

Monadic second-order model-checking on decomposable matroids

Yann Strozecki
Discrete Applied Mathematics 159 (10) 1022 (2011)
DOI: 10.1016/j.dam.2011.02.005
See this article

Polar permutation graphs are polynomial-time recognisable

Tınaz Ekim, Pinar Heggernes and Daniel Meister
European Journal of Combinatorics 34 (3) 576 (2013)
DOI: 10.1016/j.ejc.2011.12.007
See this article

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes

Konrad K. Dabrowski, Vadim V. Lozin and Daniël Paulusma
Order (2017)
DOI: 10.1007/s11083-017-9430-7
See this article

Tree-width of graphs without a 3×3 grid minor

E. Birmelé, J.A. Bondy and B.A. Reed
Discrete Applied Mathematics 157 (12) 2577 (2009)
DOI: 10.1016/j.dam.2008.08.003
See this article

Handle-rewriting hypergraph grammars

Bruno Courcelle, Joost Engelfriet and Grzegorz Rozenberg
Journal of Computer and System Sciences 46 (2) 218 (1993)
DOI: 10.1016/0022-0000(93)90004-G
See this article

The monadic second-order logic of graphs VIII: Orientations

Bruno Courcelle
Annals of Pure and Applied Logic 72 (2) 103 (1995)
DOI: 10.1016/0168-0072(95)94698-V
See this article

Graph-Theoretic Concepts in Computer Science

Jiří Fiala and Petr A. Golovach
Lecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 5344 134 (2008)
DOI: 10.1007/978-3-540-92248-3_13
See this article

Parameterized Complexity of the Spanning Tree Congestion Problem

Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi and Erik Jan van Leeuwen
Algorithmica 64 (1) 85 (2012)
DOI: 10.1007/s00453-011-9565-7
See this article

The complexity of two graph orientation problems

Nicole Eggemann and Steven D. Noble
Discrete Applied Mathematics 160 (4-5) 513 (2012)
DOI: 10.1016/j.dam.2011.10.036
See this article

Algorithms for unipolar and generalized split graphs

Elaine M. Eschen and Xiaoqiang Wang
Discrete Applied Mathematics 162 195 (2014)
DOI: 10.1016/j.dam.2013.08.011
See this article

Monadic second-order definable graph transductions: a survey

Bruno Courcelle
Theoretical Computer Science 126 (1) 53 (1994)
DOI: 10.1016/0304-3975(94)90268-2
See this article

Exploiting structure in quantified formulas

Richard E. Stearns and Harry B. Hunt
Journal of Algorithms 43 (2) 220 (2002)
DOI: 10.1016/S0196-6774(02)00002-0
See this article

Chordal bipartite graphs of bounded tree- and clique-width

V. Lozin and D. Rautenbach
Discrete Mathematics 283 (1-3) 151 (2004)
DOI: 10.1016/j.disc.2004.02.008
See this article

References

Discrete Applied Mathematics 54 (2-3) 281 (1994)
DOI: 10.1016/0166-218X(94)90028-0
See this article

Combinatorial and computational aspects of graph packing and graph decomposition

Raphael Yuster
Computer Science Review 1 (1) 12 (2007)
DOI: 10.1016/j.cosrev.2007.07.002
See this article

Combinatorial Optimization and Applications

Raquel Águeda, Nathann Cohen, Shinya Fujita, et al.
Lecture Notes in Computer Science, Combinatorial Optimization and Applications 10043 241 (2016)
DOI: 10.1007/978-3-319-48749-6_18
See this article

Graph Theoretic Concepts in Computer Science

Yota Otachi, Hans L. Bodlaender and Erik Jan van Leeuwen
Lecture Notes in Computer Science, Graph Theoretic Concepts in Computer Science 6410 3 (2010)
DOI: 10.1007/978-3-642-16926-7_3
See this article

Intractability of Clique-Width Parameterizations

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov and Saket Saurabh
SIAM Journal on Computing 39 (5) 1941 (2010)
DOI: 10.1137/080742270
See this article

Combinatorial Algorithms

Konrad K. Dabrowski, Vadim V. Lozin and Daniël Paulusma
Lecture Notes in Computer Science, Combinatorial Algorithms 9843 253 (2016)
DOI: 10.1007/978-3-319-44543-4_20
See this article

The obstructions of a minor-closed set of graphs defined by a context-free grammar

B Courcelle and G Sénizergues
Discrete Mathematics 182 (1-3) 29 (1998)
DOI: 10.1016/S0012-365X(97)83079-8
See this article

Algorithms and Complexity

Cristina Bazgan, Thomas Pontoizeau and Zsolt Tuza
Lecture Notes in Computer Science, Algorithms and Complexity 10236 80 (2017)
DOI: 10.1007/978-3-319-57586-5_8
See this article

Graph decompositions for cartesian products

Selma Djelloul
Electronic Notes in Discrete Mathematics 22 375 (2005)
DOI: 10.1016/j.endm.2005.06.073
See this article

MSOL restricted contractibility to planar graphs

James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil
Theoretical Computer Science 676 1 (2017)
DOI: 10.1016/j.tcs.2017.02.030
See this article

Upper bounds to the clique width of graphs

Bruno Courcelle and Stephan Olariu
Discrete Applied Mathematics 101 (1-3) 77 (2000)
DOI: 10.1016/S0166-218X(99)00184-5
See this article

(1,j)-set problem in graphs

Arijit Bishnu, Kunal Dutta, Arijit Ghosh and Subhabrata Paul
Discrete Mathematics 339 (10) 2515 (2016)
DOI: 10.1016/j.disc.2016.04.008
See this article