Factors and Factorizations of Graphs

Proof Techniques in Factor Theory

  • Jin Akiyama
  • Mikio Kano

Part of the Lecture Notes in Mathematics book series (LNM, volume 2031)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Jin Akiyama, Mikio Kano
    Pages 1-14
  3. Jin Akiyama, Mikio Kano
    Pages 15-67
  4. Jin Akiyama, Mikio Kano
    Pages 69-141
  5. Jin Akiyama, Mikio Kano
    Pages 143-191
  6. Jin Akiyama, Mikio Kano
    Pages 193-218
  7. Jin Akiyama, Mikio Kano
    Pages 219-251
  8. Jin Akiyama, Mikio Kano
    Pages 253-293
  9. Jin Akiyama, Mikio Kano
    Pages 295-336
  10. Back Matter
    Pages 337-356

About this book

Introduction

This book chronicles the development of graph factors and factorizations. It pursues a comprehensive approach, addressing most of the important results from hundreds of findings over the last century. One of the main themes is the observation that many theorems can be proved using only a few standard proof techniques. This stands in marked contrast to the seemingly countless, complex proof techniques offered by the extant body of papers and books. In addition to covering the history and development of this area, the book offers conjectures and discusses open problems. It also includes numerous explanatory figures that enable readers to progressively and intuitively understand the most important notions and proofs in the area of factors and factorization.

Keywords

05C; 05CXX; 05C75 Factorizations of Graphs Factors of Graphs Matchings in Graphs Proof Technique

Authors and affiliations

  • Jin Akiyama
    • 1
  • Mikio Kano
    • 2
  1. 1.Research Institute, of Educational DevelopmentTokai UniversityShibuya-kuJapan
  2. 2.Computer and Information SciencesIbaraki UniversityHitachiJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-21919-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-642-21918-4
  • Online ISBN 978-3-642-21919-1
  • Series Print ISSN 0075-8434
  • Series Online ISSN 1617-9692
  • About this book