Responsive image
博碩士論文 etd-0908104-141354 詳細資訊
Title page for etd-0908104-141354
論文名稱
Title
與乘積封閉性相關的一個圖的運算
A graph operation related to multiplicity of graphs
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
14
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2004-06-04
繳交日期
Date of Submission
2004-09-08
關鍵字
Keywords
著色數、Hedetniemi's猜測
Hedetniemi's conjecture, multiplicative, chromatic number, Mycielski construction
統計
Statistics
本論文已被瀏覽 5722 次,被下載 1786
The thesis/dissertation has been browsed 5722 times, has been downloaded 1786 times.
中文摘要
我們使用兩種不同的方法去證明一個特殊圖的著色數為4。第一種方法是利用觀察此圖的結構而得知的。第二種方法是利用El-Zahar-Sauer和Stiebitz的方法來證明。
Abstract
In this thesis we give two different proofs of the result chromatic number of a special graph is 4. The first proof is derived by analysing the structure of the special graph. The second proof is a method which was first studied in [1].
目次 Table of Contents
1 Introduction
2 The operation
3 The first proof of Theorem 2.2
4 The second proof of Theorem 2.2
參考文獻 References
[1]H. Sachs and M. Stiebitz, On constructive methods in the theory of color-critical graphs, Discete Math 74(1989),201-226.
[2]S. T. Hedeniemi Homomophisms of graphs and automata, University of Michigan Technical Report 03105-44-7,1996.
[3]M. El-Zahar, N. W. Saure, The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5(1985), 121-126.
[4]Claude Tardif, Multiplicative graphs and semi-lattice endomorphisms in the category of graphs, preprint(2003).
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外完全公開 unrestricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code