The upper chromatic number and chromatic polynomials of some mixed hypergraphs

Description

本文分為兩章. 第一章先介紹sieve-number(即s(H)) ,並將所有mixed hypergraph的最大著色數能用n-s(H)的圖形條件限制出來.再討論能用s(H)表示其最大著色數的圖形. 第二章主要是討論interval mixed hypergraph的著色方程式.

Links & Downloads

1. http://thesis.lib.nccu.edu.tw/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr&i=sid=%22G0927510021%22.

Tags

sieve

chromatic polynomial

Additional Fields

Identifer	oai:union.ndltd.org:CHENGCHI/G0927510021
Creators	林妤芬
Publisher	國立政治大學
Source Sets	National Chengchi University Libraries
Language	英文
Detected Language	English
Type	text
Rights	Copyright © nccu library on behalf of the copyright holders