Counting unlabeled bipartite graphs using Polya's theorem

From MaRDI portal

Publication:668962

Jump to:navigation, search

zbMath1407.05126MaRDI QIDQ668962

Abdullah Atmaca, A. Yavuz Oruç

Publication date: 20 March 2019

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bbms/1547780430

zbMATH Keywords

bipartite graphs graph enumeration cycle index polynomial Polya's counting theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (1)

Compact representation of graphs with bounded bandwidth or treedepth

This page was built for publication: Counting unlabeled bipartite graphs using Polya's theorem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:668962&oldid=12575683"