目錄
Preface
Chapter 1 Introduction
1.1 Basic concepts
1.2 Basic results
Chapter 2 Rainbow Connection Number, Order and Minimum Degree (sum)
2.1 Rainbow connection number, order and minimum degree (sum)
2.2 Rainbow vertex-connection number and minimum degree (sum)
Chapter 3 Rainbow Connection Number, Radius and Diameter
3.1 Rainbow connection number and radius with bridgeless
3.2 Rainbow connection number and radius with bridges
Chapter 4 Rainbow Connection Number and Independence Number
4.1 Tight example
4.2 Lemma and observation
4.3 Theorem and proof
Chapter 5 Rainbow Connection Number of Dense, Sparse and Random Graphs
5.1 Definitions of dense, sparse and random graphs
5.2 Rainbow connection number of dense graphs
5.3 Rainbow connection number of sparse and random graphs
Chapter 6 Computational Complexity
6.1 Conjecture of NP-hard and NP-complete
6.2 NP-hard and NP-complete
Reference
Index