A Note on Counting Connected Graph Covering Projections

DOI10.1137/S0895480195293873MaRDI QIDQ4388994zbMATH OpenFDO

Authors Michael Hofmeister

Publication date 11 May 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480195293873

zbMATH Keywords

connected covering projectionenumerationgraph coveringPólya's theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Covering spaces and low-dimensional topology (57M10)

Recommendations

• scientific article; zbMATH DE number 861307
• Enumeration of connected graph coverings
• Enumerating Typical Circulant Covering Projections Onto a Circulant Graph
• Counting some finite-fold coverings of a graph

Cited in

(5)

• Enumerating typical abelian prime-fold coverings of a circulant graph
• Covering projections of graphs preserving links of vertices and edges
• Typical circulant double coverings of a circulant graph.
• Circulant double coverings of a circulant graph of valency four
• Enumerating regular graph coverings whose covering transformation groups are \(\mathbb{Z}_p\)-extensions of a cyclic group

This page was built for publication: A Note on Counting Connected Graph Covering Projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388994)