|
![]() |
|||
|
||||
OverviewThis textbook focuses on graph factorizations, an area which lies partly in graph theory and partly in the theory of combinational designs. It is intended for beginning graduate students in combinatorial mathematics, but also covers current research and should prove useful as a reference source for professionals in the field. Full Product DetailsAuthor: W.D. WallisPublisher: Springer Imprint: Springer Edition: 1997 ed. Volume: 390 Dimensions: Width: 15.60cm , Height: 1.50cm , Length: 23.40cm Weight: 1.200kg ISBN: 9780792343233ISBN 10: 0792343239 Pages: 242 Publication Date: 31 December 1996 Audience: College/higher education , Professional and scholarly , Postgraduate, Research & Scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of Contents1 Graphs.- 2 Walks, Paths and Cycles.- 3 One-Factors and One-Factorizations.- 4 Orthogonal One-Factorizations.- 5 Tournament Applications of One-Factorizations.- 6 A General Existence Theorem.- 7 Graphs without One-Factors.- 8 Edge-Colorings.- 9 One-Factorizations and Triple Systems.- 10 Starters.- 11 Invariants of One-Factorizations.- 12 Automorphisms and Asymptotic Numbers of One-Factorizations.- 13 Systems of Distinct Representatives.- 14 Subfactorizations and Asymptotic Numbers of One-Factorizations.- 15 Cyclic One-Factorizations.- 16 Perfect Factorizations.- 17 One-Factorizations of Multigraphs.- 18 Maximal Sets of Factors.- 19 The One-Factorization Conjecture.- 20 Premature Sets of Factors.- 21 Cartesian Products.- 22 Kotzig’s Problem.- 23 Other Products.- B Generators of Simple Indecomposable Factorizations.- C Generators of Nonsimple Indecomposable Factorizations.- References.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |