Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T22:25:36.936Z Has data issue: false hasContentIssue false

Labeled Bipartite Blocks

Published online by Cambridge University Press:  20 November 2018

F. Harary
Affiliation:
University of Michigan, Ann Arbor, Michigan
R. W. Robinson
Affiliation:
University of Michigan, Ann Arbor, Michigan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Graphs which are 2-connected have been called blocks in the graph theoretic literature [3] and stars in the parlance of statistical mechanics [1]. They are also called nonseparable graphs, and in this paper include the complete graph K2 on p = 2 points. The standard terminology of graphical enumeration can be found in [3].

When its points are colored using two distinct colors in such a way that adjacent points receive different colors, a graph is called 2-colored. If the colors are considered interchangeable, such a graph is called bicolored. A graph which can be bicolored is called bicolorable. It is obvious that a connected bicolorable graph has a unique bicoloring, and so one can speak of the sizes of its color classes.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1979