AbstractWe show that a class of vertex partitioning problems that can be expressed in monadic second order logic (MSOL) are polynomials on graphs of bounded clique-width. This class includes coloring, H-free coloring, domatic number and partition into perfect graphs. Moreover we show that a class of vertex and edge partitioning problems are polynomials on graphs of bounded treewidth
The paper discusses vertex partitions and edge partitions of graphs of bounded tree-width into graph...
A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs ...
Boolean-width is a recently introduced graph parameter. Many problems are fixed param-eter tractable...
International audienceWe show that a class of vertex partitioning problems that can be expressed in ...
AbstractWe show that a class of vertex partitioning problems that can be expressed in monadic second...
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs ...
Many hard problems can be solved efficiently when the input is restricted to graphs of bounded treew...
In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded ra...
AbstractIf P(x1,…,xk) is a graph property expressible in monadic second-order logic, where x1,…,xk d...
The formalism of monadic second-order (MS) logic has been very successful in unifying a large number...
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
International audienceClique-width is a relatively new parameterization of graphs, philosophically s...
This paper studies degree-bounded vertex partitions, derives analogues for well-known results on the...
AbstractThe paper presents several results on edge partitions and vertex partitions of graphs into g...
The paper discusses vertex partitions and edge partitions of graphs of bounded tree-width into graph...
A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs ...
Boolean-width is a recently introduced graph parameter. Many problems are fixed param-eter tractable...
International audienceWe show that a class of vertex partitioning problems that can be expressed in ...
AbstractWe show that a class of vertex partitioning problems that can be expressed in monadic second...
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs ...
Many hard problems can be solved efficiently when the input is restricted to graphs of bounded treew...
In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded ra...
AbstractIf P(x1,…,xk) is a graph property expressible in monadic second-order logic, where x1,…,xk d...
The formalism of monadic second-order (MS) logic has been very successful in unifying a large number...
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
International audienceClique-width is a relatively new parameterization of graphs, philosophically s...
This paper studies degree-bounded vertex partitions, derives analogues for well-known results on the...
AbstractThe paper presents several results on edge partitions and vertex partitions of graphs into g...
The paper discusses vertex partitions and edge partitions of graphs of bounded tree-width into graph...
A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs ...
Boolean-width is a recently introduced graph parameter. Many problems are fixed param-eter tractable...
DOI
Add to ORKG