scientific article; zbMATH DE number 1305558
Recently, \textit{S. Yamada} introduced an invariant of general ``flat vertex spatial graphs [J. Graph Theory 13, No. 5, 537-551 (1989; Zbl 0682.57003)] which, in the case of links, coincides with a one-variable specialization of the Kauffman polynomial. Moreover, he established a simple relationship between this specialization of the Kauffman polynomial and the Jones polynomial of the untwisted 2-parallel of a link [Topology 28, No. 3, 369-377 (1989; Zbl 0685.57002)]. In the first part of this paper, the author shows how to use the Kauffman polynomial to construct a 2-variable invariant of ``flat vertex spatial graphs, and derives Yamada's results as a special case. In the second part, he points out that Yamada's polynomial for a plane graph is essentially the ``flow polynomial of this graph. This object has received much attention in graph theory in connection with the Four-Color problem. The author presents some consequences of this interaction between graph theory and knot theory: new proofs of some recent results on adequate diagrams and alternating links [\textit{W. B. R. Lickorish} and \textit{M. B. Thistlethwaite}, Comment. Math. Helv. 63, No. 4, 527-539 (1988; Zbl 0686.57002); \textit{M. B. Thistlethwaite}, Invent. Math. 93, No. 2, 285-296 (1988; Zbl 0645.57007)], and a state model for the Yamada polynomial of a link. Finally, the author briefly shows how the knot-theoretic approach sheds new light on results of \textit{R. Penrose} [Combinat. Math. Appl., Proc. Conf. Math. Inst., Oxford 1969, 221-244 (1971; Zbl 0216.43502)] and \textit{W. T. Tutte} [J. Comb. Theory 9, 289-296 (1970; Zbl 0209.55001); Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969, 439-453 (1970; Zbl 0249.05115)]. For the entire collection see [Zbl 0913.00020].
- Tutte chromatic identities from the Temperley-Lieb algebra
- On the Kauffman polynomial of an adequate link
- The Yamada polynomial of spacial graphs and knit algebras
- \(A_2\) colored polynomials of rigid vertex graphs
- Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4
- Minimal obstructions to ( , k )-polarity in cographs
- Invariants of framed graphs and the Kadomtsev-Petviashvili hierarchy
- On the Kauffman-Vogel and the Murakami-Ohtsuki-Yamada graph polynomials
- scientific article; zbMATH DE number 4134073 (Why is no real title available?)
- scientific article; zbMATH DE number 421743 (Why is no real title available?)
- The Kauffman polynomial and trivalent graphs
- Ozsváth-Szabó d-invariants of almost simple linear graphs
- scientific article; zbMATH DE number 4199041 (Why is no real title available?)
- Kauffman's clock lattice as a graph of perfect matchings: a formula for its height
- An invariant of spatial graphs
- Combinatorial invariants on planar graphs
- The expansion of polynomial invariants for 2-decompositions of generalized graphs
- scientific article; zbMATH DE number 7200914 (Why is no real title available?)
- Structure of the flow and Yamada polynomials of cubic graphs
- Yamada polynomial and associated link of -curves
- Polynomials of complete spatial graphs and Jones polynomials of the related links
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 Q4252452)