An interpolation theorem for partitions which are complete with respect to hereditary properties

DOI10.1016/0095-8956(72)90065-2zbMath0268.05006OpenAlexW1994779097MaRDI QIDQ2562787

Gary Glenn Miller, E. J. Cockayne

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90065-2

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, On upper bounds for the pseudo-achromatic index, Computational aspects of greedy partitioning of graphs, On Computational Aspects of Greedy Partitioning of Graphs, An interpolation theorem for partitions which are indivisible with respect to cohereditary properties, Combinatory interpolation theorems, Minimum partition of an independence system into independent sets, Chromatic partitions of a graph, The subchromatic number of a graph, A sequential coloring algorithm for finite sets, Interpolation theorems for graphs, hypergraphs and matroids

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Graphs with forbidden subgraphs
• Hereditary properties of raphs
• On Representatives of Subsets
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• The achromatic number of a graph