圖的權重選擇性

Chun-Yen Kuo; 郭俊彥

請用此 Handle URI 來引用此文件： http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/62679

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.advisor	張鎮華
dc.contributor.author	Chun-Yen Kuo	en
dc.contributor.author	郭俊彥	zh_TW
dc.date.accessioned	2021-06-16T16:07:17Z	-
dc.date.available	2013-06-21
dc.date.copyright	2013-06-21
dc.date.issued	2013
dc.date.submitted	2013-06-10
dc.identifier.citation	[1] L. Addario-Berry, R. E. L. Aldred, K. Dalal and B. A. Reed, Vertex colouring edge partitions, J. Combin. Theory Ser. B 94 (2005), 237-244. [2] L. Addario-Berry, K. Dalal, C. McDiarmid, B. A. Reed and A. Thomason, Vertex-colouring edge-weightings, Combinatorica 27 (2007), 1-12. [3] S. Akbari, E. Ehsani and P. Jalaly Khalilabadi. Submitted to European Journal of Combinatorics (2011). [4] N. Alon, Combinatorial Nullstellensatz, Combin. Prob. Comput. 8 (1999), 7-29. [5] N. Alon and M.Tarsi, Anowhere-zero point in linear mappings, Combinatorica 9 (1989), 393-395. [6] H.J. Bandelt and H.M. Mulder Distance{hereditary graphs J. Combin. Theory Ser. B 41 (1986), 182-208. [7] T. Bartnicki, J. Grytczuk and S. Niwczyk,Weight choosability of graphs,J. Graph Theory 60 (2009), 242-256. [8] A. Frieze, R. J. Gould, M. Karo nski and F. Pfender, On graph irregularity strength, J. Graph Theory 41 (2002), 120-137. [9] M. Kalkowski, M. Karo nski and F. Pfender, Vertex-coloring edge-weightings: towards the 1-2-3-Conjecture, J. Combin. Theory 100 (2010) 347-349. [10] M. Karo nski, T. Luczak and A. Thomason, Edge weights and vertex colours, J. Combin. Theory Ser. B 91 (2004), 151-157.
dc.identifier.uri	http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/62679	-
dc.description.abstract	1,2,3-猜想，是一個在距今約10年前被提出來的圖的權重選擇性的猜想。雖然現在還是未被證明出來，但在近年來也已經有了很大的進展。於是就有人提出了更高難度的猜想：3-重量可選猜想，並希望能藉由3-重量可選猜想的證明來順便解決1,2,3-猜想這個問題。本篇論文主要是證明出來所有的完全多分圖、仙人掌圖、餘圖以及距離繼承圖全部也都是3-重量可選的。	zh_TW
dc.description.abstract	1,2,3 – conjecture, for the problem of weight choosability and which was posed by Karo’nski in 2004. Even though it is a unsolved problem in graph theory, someone proved it in some special cases of graphs. Bartnicki, Grytczuk and Niwczyk posed a more difficult conjecture: 3-weight choosable conjecture, and make a different approach for the problem. The main results of this thesis is to prove that complete r-partite graphs, cactus, cographs, and distance-hereditary graphs are 3-weight choosable.	en
dc.description.provenance	Made available in DSpace on 2021-06-16T16:07:17Z (GMT). No. of bitstreams: 1 ntu-102-R00221004-1.pdf: 1847230 bytes, checksum: 39fee36d42deeebc3aaad6448548e9a5 (MD5) Previous issue date: 2013	en
dc.description.tableofcontents	致謝 i 中文摘要 ii Abstract iii Introduction 1 Polynomials and permanents 2 Preserving low monomial index 4 Weight choosability of cactus 6 Weight choosability of distance-hereditary graphs 11 References 35
dc.language.iso	zh-TW
dc.subject	距離繼承圖	zh_TW
dc.subject	仙人掌圖	zh_TW
dc.subject	完全多分圖	zh_TW
dc.subject	權重選擇性	zh_TW
dc.subject	餘圖	zh_TW
dc.subject	3-重量可選猜想	zh_TW
dc.subject	weight choosability	en
dc.subject	3-weight choosable	en
dc.subject	complete r-partite graphs	en
dc.subject	cactus	en
dc.subject	cograph	en
dc.subject	distance-hereditary graph	en
dc.title	圖的權重選擇性	zh_TW
dc.title	Weight Choosability of Graphs	en
dc.type	Thesis
dc.date.schoolyear	101-2
dc.description.degree	碩士
dc.contributor.oralexamcommittee	李國偉,顏經和
dc.subject.keyword	權重選擇性,3-重量可選猜想,完全多分圖,仙人掌圖,餘圖,距離繼承圖,	zh_TW
dc.subject.keyword	weight choosability,3-weight choosable,complete r-partite graphs,cactus,cograph,distance-hereditary graph,	en
dc.relation.page	35
dc.rights.note	有償授權
dc.date.accepted	2013-06-10
dc.contributor.author-college	理學院	zh_TW
dc.contributor.author-dept	數學研究所	zh_TW
顯示於系所單位：	數學系

文件中的檔案：

檔案	大小	格式
ntu-102-1.pdf 未授權公開取用	1.8 MB	Adobe PDF

顯示文件簡單紀錄

系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。