scientific article; zbMATH DE number 176203

MaRDI QIDQ4035307zbMATH OpenFDO

Authors J. C. E. Dekker

Publication date 18 May 1993

zbMATH Keywords

partitionchromatic numberKneser graphisolsrecursive equivalence typechromatic isolintersecting classes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Recursive equivalence types of sets and structures, isols (03D50)

Recommendations

• On the chromatic number of the general Kneser-graph
• On chromatic number of general Kneser graphs
• Extremal problems concerning Kneser-graphs
• The Chromatic Number of Kneser Hypergraphs
• Some multiple chromatic numbers of Kneser graphs

Cited in

(3)

• Isols and maximal intersecting classes
• Isospectral Kähler graphs
• Isomorphism of graphs which are pairwise k-separable

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 Q4035307)