We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (D1,D1)-partitionable planar graphs with respect to the property D1 "to be a forest"
A property of graphs is any class of graphs closed under isomor-phism. A property of graphs is induc...
AbstractFor properties of graphs P1 and P2 a vertex (P1,P2)-partition of a graph G is a partition (V...
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induce...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
Let ₁, ₂ be graph properties. A vertex (₁,₂)-partition of a graph G is a partition {V₁,V₂} of V(G) s...
Let ₁,₂,...,ₙ be graph properties, a graph G is said to be uniquely (₁,₂, ...,ₙ)-partitionable if th...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
As a common generalization of bipartite and split graphs, monopolar graphs are defined in terms of t...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractFor properties of graphs P1 and P2 a vertex (P1,P2)-partition of a graph G is a partition (V...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
A property of graphs is any class of graphs closed under isomor-phism. A property of graphs is induc...
AbstractFor properties of graphs P1 and P2 a vertex (P1,P2)-partition of a graph G is a partition (V...
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induce...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
Let ₁, ₂ be graph properties. A vertex (₁,₂)-partition of a graph G is a partition {V₁,V₂} of V(G) s...
Let ₁,₂,...,ₙ be graph properties, a graph G is said to be uniquely (₁,₂, ...,ₙ)-partitionable if th...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
As a common generalization of bipartite and split graphs, monopolar graphs are defined in terms of t...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractFor properties of graphs P1 and P2 a vertex (P1,P2)-partition of a graph G is a partition (V...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
A property of graphs is any class of graphs closed under isomor-phism. A property of graphs is induc...
AbstractFor properties of graphs P1 and P2 a vertex (P1,P2)-partition of a graph G is a partition (V...
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induce...
DOI
Add to ORKG