×

On a quasiordering of bipartite graphs. (English) Zbl 0623.05050

For the family B of bipartite graphs, the authors consider a quasi- ordering of B based on the coefficients of their characteristic polynomials. They then prove three rather technical results about bipartite graphs arising from operations involving bipartite graphs, paths and even length cycles.
Reviewer: B.Alspach

MSC:

05C99 Graph theory
PDF BibTeX XML Cite
Full Text: EuDML