arXiv:math/0606479 Abstract

Published 2006-06-20, updated 2007-07-29Version 2

In this note we give a combinatorial characterization of all the unmixed bipartite graphs.

Comments: To appear in Rev. Colombiana Mat

Journal: Rev. Colombiana Mat. 41(2)(2007), 393-395

Categories: math.CO, math.AC

Subjects: 05C75, 13H10

Keywords: unmixed bipartite graphs, combinatorial characterization

Tags: journal article

Related articles: Most relevant | Search more

arXiv:1511.00228 [math.CO] (Published 2015-11-01)

Unmixed r-partite graphs

arXiv:1211.3929 [math.CO] (Published 2012-11-16, updated 2013-12-24)

Fat Hoffman graphs with smallest eigenvalue greater than -3

arXiv:2306.17076 [math.CO] (Published 2023-06-29)

A combinatorial characterization of $S_2$ binomial edge ideals

arXiv Analytics