scientific article; zbMATH DE number 524137

MaRDI QIDQ4284626zbMATH OpenFDO

Authors Norbert Sauer

Publication date 24 March 1994

zbMATH Keywords

chromatic numbergirthhypergraphpartition problems

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• On coloring uniform hypergraphs without 3-cycles
• Chromatic numbers and homomorphisms of large girth hypergraphs
• On regular hypergraphs with high girth and high chromatic number
• Some remarks on vertex Folkman numbers for hypergraphs
• On colorings of non-uniform hypergraphs without short cycles

Cited in

(9)

• Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
• Generalized pigeonhole properties of graphs and oriented graphs
• Nullspace vertex partition in graphs
• The vertex separator problem: algorithms and computations
• Vertex colorings of graphs without short odd cycles
• Chromatic numbers and homomorphisms of large girth hypergraphs
• On the Ramsey Property of Families of Graphs
• Co-2-plex vertex partitions
• Minimization and parameterized variants of vertex partition problems on graphs

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