Access Restriction

Author Voloshin, Vitaly
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Mixed Hypergraphs ♦ Proper Coloring ♦ Minimum Number ♦ Chromatic Number ♦ Distinct Color ♦ Hypergraph Coloring ♦ Chromatic Spec-trum ♦ Open Problem ♦ Survey Recent Result ♦ Maximum Number ♦ Color Becomes
Abstract We survey recent results and open problems on the chromatic spec-trum, planarity and colorability of mixed hypergraphs and their rela-tions to such categories of philosophy as identity and difference. 1 Coloring Theory Most of classical coloring theory can be described using hypergraph coloring as introduced by P. Erdős and A. Hajnal in 1966 [4]. A hypergraph [2] H = (X, E) is a set of vertices X and a set of edges E, where each edge is a subset of the vertex set. A proper coloring of a hypergraph is a coloring of the vertex set such that every edge has at least two vertices with distinct colors. This generalizes the condition for proper colorings of graphs. The chromatic number of a hypergraph is the minimum number of colors used in a proper coloring. Historically, coloring theory was the theory on the minimum number of colors. The maximum number of colors becomes interesting and nontrivial when we introduce another type of constraint on
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study