scientific article; zbMATH DE number 139735

From MaRDI portal
Publication:4028068





[For the entire collection see Zbl 0747.00024.] A Brunnian graph is one for which every proper subgraph can be isotoped into the plane, but the graph itself cannot. Suzuki has given a family \(\theta_ n\) of Brunnian graphs with an algebraic proof that they are not planar. This paper gives an alternative proof, based on converting the 2-vertex graphs \(\theta_ n\) into `2-bridge graphs'. A previous paper of the author gives a criterion for whether such a graph is planar, and use of the Burau representation of the braid group is made here to show that the criterion is not satisfied.











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 Q4028068)