The topological theory of current graphs

DOI10.1016/0095-8956(74)90028-8zbMath0298.05106OpenAlexW2054779640WikidataQ29031718 ScholiaQ29031718MaRDI QIDQ1214425

Seth R. Alpert, Jonathan L. Gross

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90028-8

Mathematics Subject Classification ID

Covering spaces and low-dimensional topology (57M10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Relations of low-dimensional topology with graph theory (57M15)

Related Items (31)

The combinatorics of gradient-like flows and foliations on closed surfaces. I: Topological classification ⋮ A tighter bounding interval for the 1-chromatic number of a surface ⋮ Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph ⋮ The genus series for maps ⋮ Genus distributions for two classes of graphs ⋮ Factorisations for partition functions of random Hermitian matrix models ⋮ Square integer Heffter arrays with empty cells ⋮ Doubly even orientable closed 2-cell embeddings of the complete graph ⋮ Dual imbeddings and wrapped quasi-coverings of graphs ⋮ Signatures, Lifts, and Eigenvalues of Graphs ⋮ Algebraic specification of interconnection network relationships by permutation voltage graph mappings ⋮ Vertex-transitive polyhedra of higher genus. I ⋮ The medial graph and voltage-current duality ⋮ Components of branched coverings of current graphs ⋮ Sets with involutions: power group enumeration ⋮ Genus embeddings for some complete tripartite graphs ⋮ The genus of nearly complete graphs-case 6 ⋮ Embeddings of covering projections of graphs ⋮ Every connected regular graph of even degree is a Schreier coset graph ⋮ Generating all graph coverings by permutation voltage assignments ⋮ Biembeddings of symmetric \(n\)-cycle systems ⋮ l-regular rotations of the countably infinite complete graph ⋮ Observations on the construction of covers using permutation voltage assignments ⋮ Genus distributions for bouquets of circles ⋮ Voltage graphs ⋮ Lifting graph automorphisms by voltage assignments ⋮ Heffter arrays and biembedding graphs on surfaces ⋮ Quotients of connected regular graphs of even degree ⋮ Branched coverings of graph imbeddings ⋮ Even Embeddings of the Complete Graphs and Their Cycle Parities ⋮ Extended graph rotation systems as a model for cyclic weaving on orientable surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Components of branched coverings of current graphs
• Twofold triple systems and graph imbeddings
• Quotients of complete graphs: revisiting the Heawood map-coloring problem
• Generating all graph coverings by permutation voltage assignments
• Branched coverings of graph imbeddings
• The genus of K12s
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Solution of the Heawood map-coloring problem—case 11
• Orientable embedding of Cayley graphs
• Branched and folded coverings
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen

This page was built for publication: The topological theory of current graphs