No label defined (Q3764175)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4021173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4021173 |
Statements
1985
0 references
graph
0 references
property
0 references
critical
0 references
0.8220489621162415
0 references
0.8104650378227234
0 references
0.8056954741477966
0 references
0.8033591508865356
0 references
[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)].
0 references