Topological theory of graphs /
"This book presents a topological approach to combinatorial configuration, in particular graphs, by introducing a new pair of homology and cohomology via polyhedral. On this basis, a number of problems are solved using a new approach, such as the embeddability of a graph on a surface (orientabl...
Saved in:
Main Authors: | |
---|---|
Published: |
De Gruyter,
|
Publisher Address: | Berlin : |
Publication Dates: | [2017] |
Literature type: | Book |
Language: | English |
Subjects: | |
Summary: |
"This book presents a topological approach to combinatorial configuration, in particular graphs, by introducing a new pair of homology and cohomology via polyhedral. On this basis, a number of problems are solved using a new approach, such as the embeddability of a graph on a surface (orientable and nonorientable) with given genus, the Gauss crossing conjecture, the graphicness and cographicness of a matroid and so forth. Notably, the specific case of embeddability on a surface of genus zero leads to a number of corollaries, including the theorems of Lefschetz (on double coverings), of MacLane (on cycle bases), and of Whitney (on duality) for planarity. Relevant problems includes the Jordan of axiom in polyhedral forms, efficient methods for extremality for recognizing a variety of embeddings (including rectilinear layouts in VLSI), and pan-polynomials, including those of Jones, Kauffman (on knots), and Tutte (on graphs), among others"--Back cover. |
Carrier Form: | xi, 357 pages : illustrations ; 25 cm |
Bibliography: | Includes bibliographical references (pages [331]-345) and index. |
ISBN: |
9783110476699 311047669X |
Index Number: | QA166 |
CLC: | O189 |
Call Number: | O189/L783 |
Contents: |
Premliminaries -- Polyhedra -- Surfaces -- Homology on polyhedra -- Polyhedra on the sphere -- Automorphism of a polyhedron -- Gauss crossing sequences -- Cohomology on graphs -- Embeddability on surface -- Embeddings on sphere -- Orthogonality on surfaces -- Net embeddings -- Extremality on surfaces -- Matoidal graphicness -- Knot polynomials. |