On the number of bi-colored graphs

DOI10.2140/pjm.1958.8.743zbMath0084.19402OpenAlexW1997119511WikidataQ56001817 ScholiaQ56001817MaRDI QIDQ770045

Frank Harary

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

zbMATH Keywords

topology

Related Items (21)

Anti-isomorphisms of completely 0-simple semigroups ⋮ Enumeration of graphs with given weighted number of connected components ⋮ The Number of Isomorphism Types of Finite Algebras ⋮ Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach ⋮ Enumeration of point-determining graphs ⋮ Enumeration of bipartite graphs and bipartite blocks ⋮ Enumeration of packed graphs ⋮ Enumeration of unlabeled uniform hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting completely 0-simple and completely simple semigroups ⋮ Enumeration of hypergraphs ⋮ On the arithmetic product of combinatorial species ⋮ On the size of two families of unlabeled bipartite graphs ⋮ The number of strongly connected directed graphs ⋮ Enumerating Types of Boolean Functions ⋮ On edge but not vertex transitive regular graphs ⋮ Enumeration under two representations of the wreath product ⋮ Permutations with Restricted Position ⋮ A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences ⋮ On the number of balanced signed graphs

This page was built for publication: On the number of bi-colored graphs