On uniquely partitionable planar graphs

DOI10.1016/S0012-365X(98)00102-2MaRDI QIDQ1584417zbMATH OpenOpenAlexFDO

Authors Peter Mihók, Jozef Bucko, Margit Voigt

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00102-2

zbMATH Keywords

hereditary properties partition uniquely partitionable planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Review text

Let \({\mathcal P}_1,{\mathcal P}_2,\dots,{\mathcal P}_n\); \(n\geq 2\) be any properties of graphs. A vertex \(({\mathcal P}_1,{\mathcal P}_2,\dots,{\mathcal P}_n)\)-partition of a graph \(G\) is a partition \((V_1,V_2,\dots, V_n)\) of \(V(G)\) such that for each \(i= 1,2,\dots, n\) the induced subgraph \(G[V_i]\) has the property \({\mathcal P}_i\). A graph \(G\) is said to be uniquely \(({\mathcal P}_1,{\mathcal P}_2,\dots,{\mathcal P}_n)\)-partitionable if \(G\) has unique vertex \(({\mathcal P}_1,{\mathcal P}_2,\dots,{\mathcal P}_n)\)-partition. In the present paper we investigate the problem of the existence of uniquely \(({\mathcal P}_1,{\mathcal P}_2,\dots,{\mathcal P}_n)\)-partitionable planar graphs for additive and hereditary properties \({\mathcal P}_1,{\mathcal P}_2,\dots,{\mathcal P}_n\) of graphs. Some constructions and open problems are presented for \(n= 2\).

Recommendations

Cites work

Cited in

(11)

This page was built for publication: On uniquely partitionable planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584417)