The minimum number of polychromatic C-hyperedges of the complete uniform mixed hypergraphs under one special condition.(Report): An article from: Scientia Magna

This digital document is an article from Scientia Magna, published by American Research Press on December 1, 2009. The length of the article is 5144 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.

From the author: Keywords A complete uniform mixed hypergraph, polychromatic C-hyperedges, the minimum, upper chromatic number, lower chromatic number.

Citation Details
Title: The minimum number of polychromatic C-hyperedges of the complete uniform mixed hypergraphs under one special condition.(Report)
Author: Guobiao Zheng
Publication:Scientia Magna (Magazine/Journal)
Date: December 1, 2009
Publisher: American Research Press
Volume: 5 Issue: 4 Page: 65(11)

Article Type: Report

Distributed by Gale, a part of Cengage Learning