Weight Choosability of Graphs
碩士 === 國立臺灣大學 === 數學研究所 === 101 === 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 con...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/48139902453842899502 |
id |
ndltd-TW-101NTU05479018 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NTU054790182015-10-13T23:10:17Z http://ndltd.ncl.edu.tw/handle/48139902453842899502 Weight Choosability of Graphs 圖的權重選擇性 Chun-Yen Kuo 郭俊彥 碩士 國立臺灣大學 數學研究所 101 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. 張鎮華 2013 學位論文 ; thesis 35 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 數學研究所 === 101 === 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.
|
author2 |
張鎮華 |
author_facet |
張鎮華 Chun-Yen Kuo 郭俊彥 |
author |
Chun-Yen Kuo 郭俊彥 |
spellingShingle |
Chun-Yen Kuo 郭俊彥 Weight Choosability of Graphs |
author_sort |
Chun-Yen Kuo |
title |
Weight Choosability of Graphs |
title_short |
Weight Choosability of Graphs |
title_full |
Weight Choosability of Graphs |
title_fullStr |
Weight Choosability of Graphs |
title_full_unstemmed |
Weight Choosability of Graphs |
title_sort |
weight choosability of graphs |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/48139902453842899502 |
work_keys_str_mv |
AT chunyenkuo weightchoosabilityofgraphs AT guōjùnyàn weightchoosabilityofgraphs AT chunyenkuo túdequánzhòngxuǎnzéxìng AT guōjùnyàn túdequánzhòngxuǎnzéxìng |
_version_ |
1718084485990318080 |