scientific article; zbMATH DE number 4021173
[For the entire collection see Zbl 0588.00010.] Given a graph G and a property P of graphs, the minimum n for which there exists a partition of V(G) into n classes, each inducing a subgraph with property P, is denoted by \(\chi_ P(G)\). If \(\chi_ P(G)=n\) and \(\chi_ P(G-v)=n-1\) for every v in V(G), G is (n,P)-critical. The properties (n,P)-minimal and (n,P)-unique are defined in similar obvious ways. All three properties are treated in this article, extending results of various authors (usually obtained for particular properties P), in particular \textit{A. Thomason} [Discrete Math. 41, 67-77 (1982; Zbl 0493.05028)].
- The existence of uniquely \(-G\) colourable graphs
- On uniquely partitionable planar graphs
- Generalized pigeonhole properties of graphs and oriented graphs
- The complexity of generalized graph colorings
- scientific article; zbMATH DE number 5989953 (Why is no real title available?)
- scientific article; zbMATH DE number 3959463 (Why is no real title available?)
- On \({\mathcal N}\)-graphs
- scientific article; zbMATH DE number 27232 (Why is no real title available?)
- Partitioning a graph into two isomorphic pieces
- On minimal arbitrarily partitionable graphs
- On multigraphs with a given partition
- scientific article; zbMATH DE number 966836 (Why is no real title available?)
- scientific article; zbMATH DE number 4187852 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764175)