scientific article; zbMATH DE number 3993640
This part contains Sections 8 and 9 of the paper, in which the author looks back on the career of his study and research in graph theory. This paper is a very interesting one. Contrary to usual mathematics papers where nice theorems and elegant proofs are pursued but the vestiges of the ideas which led the way to the results are carefully cleared up, in this paper, results are introduced along the line they were got, so that the reader can see the underlying ideas which are the quintessence of the paper. In Section 8, the author describes how the algebraic approach in studying 3-regular graphs led to the consideration of chain groups and, furthermore, to the notion of matroids, and, on the other hand, how the characterization of graphic matroids was found. In Section 9, the reconstruction problem is considered. Starting with a multiplication recurrence relation of the chromatic polynomials of graphs, the author shows how a lemma by Kelly is used to prove the reconstructibility of dichromatic polynomials, which are also known as the Tutte's polynomials, of graphs. A number of consequences of this theorem and some variations of the reconstruction problems are also considered. Part IV, see [Chin. J. Oper. Res. 5, No. 2, 29--62 (1986; Zbl 0654.05029)].
- scientific article; zbMATH DE number 3882430
- scientific article; zbMATH DE number 1151365
- scientific article; zbMATH DE number 4154487
- scientific article; zbMATH DE number 739267
- The contributions of Dominic Welsh to matroid theory
- Optimal structural analysis
- scientific article; zbMATH DE number 3895091
- scientific article; zbMATH DE number 4091530
- Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722111)