PDF

Discussiones Mathematicae Graph Theory 19(1) (1999) 71-78
DOI: https://doi.org/10.7151/dmgt.1086

UNIQUELY PARTITIONABLE PLANAR GRAPHS WITH RESPECT TO PROPERTIES HAVING A FORBIDDEN TREE

Jozef Bucko Department of Mathematics, Technical University Hlavná 6, 040 01 Košice, Slovak Republic e-mail: bucko@ccsun.tuke.sk

Jaroslav Ivančo Department of Geometry and Algebra P.J. Safárik University, Jesenná 5 041 54 Košice, Slovak Republic e-mail: ivanco@duro.upjs.sk

Abstract

Let P₁, P₂ be graph properties. A vertex (P₁,P₂)-partition of a graph G is a partition { V₁,V ₂} of V(G) such that for i = 1,2 the induced subgraph G[V_i] has the property P_i. A property ℜ = P₁ ºP₂ is defined to be the set of all graphs having a vertex (P₁,P₂)-partition. A graph G ∈ P₁ºP₂ is said to be uniquely (P₁,P₂)-partitionable if G has exactly one vertex (P₁,P₂)-partition. In this note, we show the existence of uniquely partitionable planar graphs with respect to hereditary additive properties having a forbidden tree.

Keywords: uniquely partitionable planar graphs, forbidden graphs.

1991 Mathematics Subject Classification: 05C15, 05C70.

References

[1]	J. Bucko, M. Frick, P. Mihók and R. Vasky, Uniquely partitionable graphs, Discuss. Math. Graph Theory 17 (1997) 103-114, doi: 10.7151/dmgt.1043.
[2]	J. Bucko, P. Mihók and M. Voigt, Uniquely partitionable planar graphs, Discrete Math. 191 (1998) 149-158, doi: 10.1016/S0012-365X(98)00102-2.
[3]	M. Borowiecki, J. Bucko, P. Mihók, Z. Tuza and M. Voigt, Remarks on the existence of uniquely partitionable planar graphs, 13. Workshop on Discrete Optimization, Burg, abstract, 1998.
[4]	P. Mihók, Additive hereditary properties and uniquely partitionable graphs, in: M. Borowiecki and Z. Skupień, eds., Graphs, hypergraphs and matroids (Zielona Góra, 1985) 49-58.

Received 14 July 1998
Revised 24 November 1998