Counting some finite-fold coverings of a graph

DOI10.1007/BF02349964zbMath0776.05056MaRDI QIDQ1199124

Jaeun Lee, Jin Ho Kwok

Publication date: 16 January 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

enumerationsisomorphism classescovering of a graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Enumeration of graph embeddings ⋮ Regular graph coverings whose covering transformation groups have the isomorphism extension property ⋮ Distributions of regular branched prime-fold coverings of surfaces ⋮ Isomorphism classes of cycle permutation graphs ⋮ Lifting graph automorphisms by voltage assignments ⋮ Isomorphisms of some graph coverings

Cites Work

• Generating all graph coverings by permutation voltage assignments
• Counting double covers of graphs
• Double covers of graphs
• Unnamed Item