We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (₁,₁)-partitionable planar graphs with respect to the property ₁ "to be a forest"
It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the r...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractThe Lick-White point-partition numbers generalize the chromatic number and the point-arboric...
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...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
Let ₁, ₂ be graph properties. A vertex (₁,₂)-partition of a graph G is a partition {V₁,V₂} of V(G) s...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
As a common generalization of bipartite and split graphs, monopolar graphs are defined in terms of t...
Let ₁,₂,...,ₙ be graph properties, a graph G is said to be uniquely (₁,₂, ...,ₙ)-partitionable if th...
Abstract: This paper studies the concepts of uniquely colorable graphs & Perfect graphs. The mai...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the r...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractThe Lick-White point-partition numbers generalize the chromatic number and the point-arboric...
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...
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some rec...
Let ₁, ₂ be graph properties. A vertex (₁,₂)-partition of a graph G is a partition {V₁,V₂} of V(G) s...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
AbstractLet P1, P2, …, Pn; n ⩾ 2 be any properties of graphs. A vertex (P1, P2, …, Pn)-partition of ...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
International audienceAn $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two...
As a common generalization of bipartite and split graphs, monopolar graphs are defined in terms of t...
Let ₁,₂,...,ₙ be graph properties, a graph G is said to be uniquely (₁,₂, ...,ₙ)-partitionable if th...
Abstract: This paper studies the concepts of uniquely colorable graphs & Perfect graphs. The mai...
AbstractThe vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set ...
It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the r...
AbstractA labeled graph G with chromatic number n is called uniquely n-colorable or simply uniquely ...
AbstractThe Lick-White point-partition numbers generalize the chromatic number and the point-arboric...
DOI
Add to ORKG