Connectivity in graphs グラフの連結度に関する研究
Access this Article
Search this Article
Author
Bibliographic Information
- Title
-
Connectivity in graphs
- Other Title
-
グラフの連結度に関する研究
- Author
-
金子, 篤司
- Author(Another name)
-
カネコ, アツシ
- University
-
慶應義塾大学
- Types of degree
-
理学博士
- Grant ID
-
甲第1160号
- Degree year
-
1992-03-23
Note and Description
博士論文
Table of Contents
- 論文目録 / p61 (0001.jp2)
- Contents / p3 (0007.jp2)
- 1 Introduction / p1 (0009.jp2)
- 2 A Mixed Version of Menger's Theorem / p8 (0016.jp2)
- 2.1 Introduction and Notation / p8 (0016.jp2)
- 2.2 Proof of Theorem 2.1.1 / p11 (0019.jp2)
- 2.3 The Condition of Beineke and Harary / p13 (0021.jp2)
- 2.4 Proof of Theorem 2.3.1 / p15 (0023.jp2)
- 3 Minimally(n,λ)-Connected Graphs / p17 (0025.jp2)
- 3.1 Introduction and Definitions / p17 (0025.jp2)
- 3.2 Main Results / p19 (0027.jp2)
- 3.3 Concluding Remarks / p30 (0038.jp2)
- 4 Admissible Paths and Cycles / p31 (0039.jp2)
- 4.1 Introduction / p31 (0039.jp2)
- 4.2 Definitions and Main Theorems / p33 (0041.jp2)
- 4.3 Basic Lemmas for Admissible Paths / p36 (0044.jp2)
- 4.4 Proofs of Theorem 4.2.1 and Theorem 4.2.2 / p46 (0054.jp2)
- 4.5 Admissible Cycles / p48 (0056.jp2)
- 4.6 Applications to Alternating Paths / p65 (0073.jp2)
- 4.7 Concluding Remarks / p68 (0076.jp2)
- Bibliography / p71 (0079.jp2)