Bipartite covering graphs

DOI10.1016/S0012-365X(99)00196-XMaRDI QIDQ1972129zbMATH OpenOpenAlexFDO

Authors Jaeun Lee, Moo Young Sohn, Dan S. Archdeacon, Jin Ho Kwak

Publication date 23 March 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00196-x

zbMATH Keywords

bipartite graphscoveringsenumeration

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Review text

The authors study coverings of non-bipartite graphs by bipartite graphs. In particular, they enumerate regular bipartite coverings for orders which are twice a prime.

Cited in

(8)

• Balanced regular coverings of a signed graph and regular branched orientable surface coverings over a non-orientable surface
• The chromatic numbers of double coverings of a graph
• Enumerating branched orientable surface coverings over a non-orientable surface
• scientific article; zbMATH DE number 68563 (Why is no real title available?)
• scientific article; zbMATH DE number 175738 (Why is no real title available?)
• Bipartite Coverings of Graphs
• Enumerating regular graph coverings whose covering transformation groups are \(\mathbb{Z}_p\)-extensions of a cyclic group
• Tetravalent s-transitive graphs of order 6p^2

This page was built for publication: Bipartite covering graphs

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