對偶超圖之著色數探討
本文藉構造bipartite graph 的形式討論超圖與對偶超圖的transversal number，進而探討最小著色數的上界，以及證明出此兩圖的最小著色數可差異很大，也可用此方法構造出想要的最小著色數之差異。最後探討在某些情形下，超圖與其對偶超圖的同構性，再則整理出其必要條件。 === H=(X,D) is called a hypergraph, where X is the vertex set and D is a family of subsets of X, denoted as D-edges, and we assume that every D-edges have at...
| Main Authors: | , |
|---|---|
| Language: | 英文 |
| Published: |
國立政治大學
|
| Subjects: | |
| Online Access: | http://thesis.lib.nccu.edu.tw/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr&i=sid=%22G0917510131%22. |