Enumeration of Bicolourable Graphs

DOI10.4153/CJM-1963-028-2zbMath0112.14903OpenAlexW2333709967MaRDI QIDQ3850556

Geert C. E. Prins, Frank Harary

Publication date: 1963

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1963-028-2

zbMATH Keywords

graph theory

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Enumeration of graphs with given weighted number of connected components ⋮ Enumeration of point-determining graphs ⋮ Enumeration of bipartite graphs and bipartite blocks ⋮ On the size of two families of unlabeled bipartite graphs ⋮ The enumeration of bipartite graphs ⋮ Enumeration of vacuously transitive relations ⋮ On the number of balanced signed graphs

This page was built for publication: Enumeration of Bicolourable Graphs