On the number of bi-colored graphs
From MaRDI portal
Publication:770045
DOI10.2140/pjm.1958.8.743zbMath0084.19402WikidataQ56001817 ScholiaQ56001817MaRDI QIDQ770045
Publication date: 1958
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1958.8.743
Related Items
Enumeration of graphs with given weighted number of connected components, On the number of balanced signed graphs, The Number of Isomorphism Types of Finite Algebras, Enumeration of hypergraphs, Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach, Enumeration of bipartite graphs and bipartite blocks, Enumeration of point-determining graphs, Enumeration of packed graphs, On the arithmetic product of combinatorial species, On the size of two families of unlabeled bipartite graphs, Enumeration of unlabeled uniform hypergraphs, The number of strongly connected directed graphs, On edge but not vertex transitive regular graphs, Enumeration under two representations of the wreath product, Enumerating Types of Boolean Functions, Permutations with Restricted Position, A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences, Unnamed Item, Unnamed Item, Counting completely 0-simple and completely simple semigroups, Anti-isomorphisms of completely 0-simple semigroups