Back to Search
Start Over
Enumeration of Bicolourable Graphs
- Source :
- Canadian Journal of Mathematics. 15:237-248
- Publication Year :
- 1963
- Publisher :
- Canadian Mathematical Society, 1963.
-
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.
Details
- ISSN :
- 14964279 and 0008414X
- Volume :
- 15
- Database :
- OpenAIRE
- Journal :
- Canadian Journal of Mathematics
- Accession number :
- edsair.doi...........8f4d32a8513da4bb3d7c3e044e6a82fc