Classes of bipartite graphs related to chordal graphs
暂无分享,去创建一个
Brandstadt, A., Classes of bipartite graphs related to chordal graphs, Discrete Applied Mathematics 32 (1991) 51-60. This paper examines in a systematical way connections between chordal, strongly chordal and split graphs and bipartite graphs with chordality properties and introduces a further notion of chordality for bipartite graphs which is called here semichordality and which gives a natural extension of the class of chordal bipartite graphs and is incomparable with the class of perfect elimination bipartite graphs.
[1] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..
[2] Richard P. Anstee,et al. Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.
[3] A. Hoffman,et al. Totally-Balanced and Greedy Matrices , 1985 .
[4] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[5] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .