Open AccessThe order of uniquely partitionable graphs
Author(s) -
Izak Broere,
Marietjie Frick,
Peter Mihók
Publication year - 1997
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1044
Subject(s) - mathematics , combinatorics , order (exchange) , discrete mathematics , business , finance
Let P1, . . . ,Pn be properties of graphs. A (P1, . . . ,Pn)-partition of a graph G is a partition {V1, . . . , Vn} of V (G) such that, for each i = 1, . . . , n, the subgraph of G induced by Vi has property Pi. If a graph G has a unique (P1, . . . ,Pn)-partition we say it is uniquely (P1, . . . ,Pn)partitionable. We establish best lower bounds for the order of uniquely (P1, . . . ,Pn)-partitionable graphs, for various choices of P1, . . . ,Pn.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom