On the number of bi-colored graphs

DOI10.2140/PJM.1958.8.743zbMATH Open0084.19402OpenAlexW1997119511WikidataQ56001817 ScholiaQ56001817MaRDI QIDQ770045FDOQ770045

Authors: 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

Cited In (21)

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

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

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