Abstract
We have discussed planar graphs, their characterization, testing and generation of codes. We have shown that the codes solve the isomorphism and automorphism group problems. Since matroids give a complete theory of duality for graphs, it is to be expected that they yield insights and characterizations for planar graphs. Conversely, a fertile field of research is to generalize known conditions on planar graphs to realizability conditions on matroids. Tutte has provided one such theorem and Welsh another. The wheel algorithm for testing planarity that we discussed yields a third characterization of matroids.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
