In this paper, we consider the task of partitioning a given graph intwo two non-empty subgraphs such that one of them has no vertex of degree less than 2, the other has no vertex of degree less than 3. We show that this problem is a difficult one
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-...
AbstractThe SATISFACTORY PARTITION problem consists in deciding if a given graph has a partition of ...
AbstractWe consider the problem of partitioning the vertex-set of a graph into four non-empty sets A...
AbstractStiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321–324] pr...
Stiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321–324] proved tha...
International audienceA (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G ...
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...
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
The researcher presents a computer-based procedure in determining the minimum number of 2-cliques an...
AbstractWe study the problem of decomposing the vertex set V of a graph into two nonempty parts V1,V...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...
AbstractIn this paper partition problems into k independent sets or cliques of bounded size k′ are a...
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-...
AbstractThe SATISFACTORY PARTITION problem consists in deciding if a given graph has a partition of ...
AbstractWe consider the problem of partitioning the vertex-set of a graph into four non-empty sets A...
AbstractStiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321–324] pr...
Stiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321–324] proved tha...
International audienceA (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G ...
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...
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
The researcher presents a computer-based procedure in determining the minimum number of 2-cliques an...
AbstractWe study the problem of decomposing the vertex set V of a graph into two nonempty parts V1,V...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...
AbstractIn this paper partition problems into k independent sets or cliques of bounded size k′ are a...
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-...
AbstractThe SATISFACTORY PARTITION problem consists in deciding if a given graph has a partition of ...
AbstractWe consider the problem of partitioning the vertex-set of a graph into four non-empty sets A...
DOI
Add to ORKG