滿額折
商品簡介
目次
相關商品
商品簡介
《圖的因子和匹配可擴性》講述了：Graph theory is one of the branches of modern mathematics which has shown impressive ad vances in recet years.An explosive growth of graph theory is witnessed due to its essential roles providing structural and indispens-able tools in computer science,communication networks and combinatorial optimization problems.
目次
1 Matchings and Perfect Matchings
1.1 Definitions and terminologies
1.2 Matcinngs in bipartite graphs and augmenting path.
1.3 Matchings in non-bipartite graphs
1.4 Sutfieient conditions for 1-factors
1.5 Gallai-Edmonds Structure Theorem
1.6 Number of 1-factors
2 Degree Constraint Factors
2.1 Characterizations of factors
2.2 Factors in bipartite graphs
2.3 Factors with special properties
2.4 L-factor
3 Factors and Graphic Parameters
3.1 Toughness and k-factors
3.2 Toughness and [a,b]-factors
3.3 Binding number and factors
3.4 Connectivity and factors
3.5 Other parameters and existence of factors
4 Component Factors and Connected Factors
4.1 Star factor
4.2 Path and cycle factors
4.3 El-Zahar''s Conjecture and other component factors.
4.4 Connected [a,b]-factors
4.5 Connected (g,f)-factors
4.6 Generalized trees
5 Elementary Graphs and Decomposition Theory
5.1 Elementary graphs and 1-extendable graphs
5.2 Ear decomposition
5.3 Minimal graphs and more decompositions
5.4 Bricks and optimal ear decomposition
6 k-Extendable Graphs and n-Factor-Critical Graphs
6.1 Characterizations and basic properties
6.2 Equivalence and recursive relationships
6.3 Matching extension and graphic parameters
6.3.1 Matching extension and forbidden subgraphs
6.3.2 Matching extension and toughness
6.3.3 Matching extension in planar graphs and surfaces
6.3.4 Matching extension, degree sum and closure operations
6.3.5 Matching extension and product of graphs
6.3.6 Matching extension and other parameters
6.4 Extendability of symmetric graphs
7 Extremal k-Extendable Graphs and Generalizations
7.1 Maximal and minimal k-extendable graphs
7.2 Generalization of matching extension
7.3 Variations of graph extension
8 Fractional Factors of Graphs
8.1 Fractional matchings
8.2 Fractional (g, f)-facturs
8.3 Parameters and fractional factors of graphs
8.4 Maximum and minimum fractional (g, f)-factors
8.5 Connected fractional factors
Index
References
1.1 Definitions and terminologies
1.2 Matcinngs in bipartite graphs and augmenting path.
1.3 Matchings in non-bipartite graphs
1.4 Sutfieient conditions for 1-factors
1.5 Gallai-Edmonds Structure Theorem
1.6 Number of 1-factors
2 Degree Constraint Factors
2.1 Characterizations of factors
2.2 Factors in bipartite graphs
2.3 Factors with special properties
2.4 L-factor
3 Factors and Graphic Parameters
3.1 Toughness and k-factors
3.2 Toughness and [a,b]-factors
3.3 Binding number and factors
3.4 Connectivity and factors
3.5 Other parameters and existence of factors
4 Component Factors and Connected Factors
4.1 Star factor
4.2 Path and cycle factors
4.3 El-Zahar''s Conjecture and other component factors.
4.4 Connected [a,b]-factors
4.5 Connected (g,f)-factors
4.6 Generalized trees
5 Elementary Graphs and Decomposition Theory
5.1 Elementary graphs and 1-extendable graphs
5.2 Ear decomposition
5.3 Minimal graphs and more decompositions
5.4 Bricks and optimal ear decomposition
6 k-Extendable Graphs and n-Factor-Critical Graphs
6.1 Characterizations and basic properties
6.2 Equivalence and recursive relationships
6.3 Matching extension and graphic parameters
6.3.1 Matching extension and forbidden subgraphs
6.3.2 Matching extension and toughness
6.3.3 Matching extension in planar graphs and surfaces
6.3.4 Matching extension, degree sum and closure operations
6.3.5 Matching extension and product of graphs
6.3.6 Matching extension and other parameters
6.4 Extendability of symmetric graphs
7 Extremal k-Extendable Graphs and Generalizations
7.1 Maximal and minimal k-extendable graphs
7.2 Generalization of matching extension
7.3 Variations of graph extension
8 Fractional Factors of Graphs
8.1 Fractional matchings
8.2 Fractional (g, f)-facturs
8.3 Parameters and fractional factors of graphs
8.4 Maximum and minimum fractional (g, f)-factors
8.5 Connected fractional factors
Index
References
今日66折
您曾經瀏覽過的商品
購物須知
大陸出版品因裝訂品質及貨運條件與台灣出版品落差甚大，除封面破損、內頁脫落等較嚴重的狀態，其餘商品將正常出貨。
特別提醒：部分書籍附贈之內容(如音頻mp3或影片dvd等)已無實體光碟提供，需以QR CODE 連結至當地網站註冊“並通過驗證程序”，方可下載使用。
無現貨庫存之簡體書，將向海外調貨：
海外有庫存之書籍，等候約45個工作天;
海外無庫存之書籍，平均作業時間約60個工作天，然不保證確定可調到貨，尚請見諒。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。