Enumeration of Bicolourable Graphs
- 1 January 1963
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 15, 237-248
- https://doi.org/10.4153/cjm-1963-028-2
Abstract
In a previous paper (2), one of us has derived a formula for the counting series for bicoloured graphs.2 These are graphs each of whose points has been coloured with exactly one of two colours in such a way that every two adjacent points have different colours.In this paper we first enumerate bicoloured graphs without isolated points and connected bicoloured graphs. This leads us to corresponding problems for bicolourable graphs. Such a graph has the property that its points can be coloured with two colours so as to obtain a bicoloured graph.Keywords
This publication has 6 references indexed in Scilit:
- A Census of Planar TriangulationsCanadian Journal of Mathematics, 1962
- The number of homeomorphically irreducible trees, and other speciesActa Mathematica, 1959
- On the number of bi-colored graphsPacific Journal of Mathematics, 1958
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955
- On the Theory of the Virial Development of the Equation of State of Monoatomic GasesThe Journal of Chemical Physics, 1953
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937