| | | | 圖的有限制條件染色引論 科學與自然 蔡建生 科學出版社 97870305 | | 該商品所屬分類：圖書 -> ε | | 【市場價】 | 948-1376元 | | 【優惠價】 | 593-860元 | | 【出版社】 | 科學出版社 | | 【ISBN】 | 9787030598677 | | 【折扣說明】 | 一次購物滿999元台幣免運費+贈品
一次購物滿2000元台幣95折+免運費+贈品
一次購物滿3000元台幣92折+免運費+贈品
一次購物滿4000元台幣88折+免運費+贈品
| | 【本期贈品】 | ①優質無紡布環保袋，做工棒！②品牌簽字筆 ③品牌手帕紙巾
|
|
| 版本 | 正版全新電子版PDF檔 | | 您已选择： | 正版全新 | 溫馨提示：如果有多種選項，請先選擇再點擊加入購物車。*. 電子圖書價格是0.69折，例如了得網價格是100元，電子書pdf的價格則是69元。
*. 購買電子書不支持貨到付款，購買時選擇atm或者超商、PayPal付款。付款後1-24小時內通過郵件傳輸給您。
*. 如果收到的電子書不滿意，可以聯絡我們退款。謝謝。 | | | |
| | 內容介紹 | |
出版社：科學出版社 ISBN：9787030598677 商品編碼：68195238635 開本：小16開 出版時間：2015-12-12 頁數：248 代碼：118
"| 商品基本信息，請以下列介紹為準 | | 商品名稱： | 圖的有限制條件染色引論 | | 作者： | 蔡建生 | | 代碼： | 118.0 | | 出版社： | 科學出版社 | | 出版日期： | | | ISBN： | 9787030598677 | | 印次： | | | 版次： | | | 裝幀： | 平裝膠訂 | | 開本： | 小16開 |
| 目錄 | Contents
Chapter 1 Acyclic Coloring 1
1.1 Basic Definitions and Notations 1
1.2 Acyclic Vertex Coloring 1
1.3 Generalized Acyclic Vertex Coloring 10
1.3.1 r-acyclic Vertex Coloring 11
1.3.2 Degenerating Coloring 17
1.4 Acyclic Edge Coloring 29
1.5 Open Problems 47
Reference 47
Chapter 2 Neior Sum Distinguishing Coloring 51
2.1 Basic Definitions and Introduction 51
2.2 Neior Sum Distinguishing Edge Coloring of Graphs 52
2.2.1 The Conjecture and Related Results 52
2.2.2 The List Version of Neior Sum Distinguishing Edge Colorings 75
2.3 Neior Sum Distinguishing Total Coloring of Graphs 76
2.3.1 The Conjecture and Related Results 76
2.3.2 Neior Sum Distinguishing Total Choosability of Graphs 78
2.4 Equitable Neior Sum Distinguishing Coloring 86
Reference 87
Chapter 3 Edge Cover Coloring 91
3.1 The Edge Cover Coloring of Graphs 91
3.1.1 Edge Cover Chromatic Index and Classi-cation of Graphs 91
3.1.2 Edge Covered Critical Graphs 97
3.1.3 Unsolved Problems on Edge Cover Coloring 102
3.2 Fractional Edge Cover Coloring of Graphs 102
3.2.1 Introduction 103
3.2.2 Main Results on Fractional Edge Cover Coloring of Graphs 105
3.2.3 The Conjectures and Discussions on Fractional Edge Cover Coloring 109
3.3 g-edge Cover Coloring of Graphs 110
3.3.1 g-edge Cover Chromatic Index of Graphs 111
3.3.2 g-Edge Covered Critical Graphs 113
3.3.3 Related Problems on g-edge Cover Coloring of Graphs 121
Reference 122
Chapter 4 f-colorings of Graphs 124
4.1 Introduction 124
4.2 Basic Definitions and Tools 125
4.3 f-colorings of Multigraphs 127
4.4 The Classification Problem of Simple Graphs on f-Colorings 131
4.4.1 Main Results 133
4.4.2 Application in Proper Edge Colorings of Simple Graphs 140
4.4.3 Further Discussion 143
4.5 Critical Graphs on f-colorings 144
4.5.1 Some Properties of f-critical Graphs 145
4.5.2 Bounds on the Number of Edges of f-critical Graphs 148
4.5.3 f-regular f-critical Graphs 151
4.5.4 f-critical Graphs with The f-core Having Maximum Degree 2 153
4.5.5 Some problems for future research 159
4.6 Equitable Edge-colorings of Simple Graphs 160
4.6.1 A Useful Lemma 163
4.6.2 A Problem for Further Research 184
Reference 185
Chapter 5 Total Coloring 188
5.1 Introduction 188
5.2 Total Coloring Conjecture and the Related Results on *≥9 188
5.2.1 Total Coloring Conjecture 188
5.3 Total Coloring of Graph G with *(G) ≤8 202
5.3.1 The Results on the Case*≤8 202
5.3.2 The Results on the Case*≤7 220
5.4 List Total Coloring of Graphs 234
5.5 The Open Problems and Conjectures 243
Reference 243
Index 247 |
" | | |
| | | | |
|
