No label defined (Q3689206)
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 3912409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3912409 |
Statements
1985
0 references
F-colorings
0 references
F-chromatic number
0 references
0.8009370565414429
0 references
0.8001484274864197
0 references
0.7835309505462646
0 references
[For the entire collection see Zbl 0564.00004.] From the authors' abstract: ''Let \(F\neq K_ 1\) be any graph. A graph G is called F-free if F is not an induced subgraph of G. If F and G are graphs, then an F-coloring of G is a partition of V(G) into subsets that induce F-free subgraphs of G. The F-chromatic number \(F<G>\) of G is the smallest number of color classes needed for an F-coloring of G. In this paper we study F-colorings and the F-chromatic number of graphs. The relationship between F-colorings and colorings is indicated and graphs for which \(K_{1,2}\)-colorings and cocolorings coincide are characterized. The problem of finding a graph G subject to certain restrictions for which \(F<G>\) is arbitrarily large, is investigated. In this connection, we list several classes of graphs F and H for which there exists, for each integer \(n>1\), a graph G with \(F<G>>n\) while G does not contain H as induced subgraph.''
0 references