Classes of bipartite graphs related to chordal graphs
暂无分享,去创建一个
Abstract 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] Andreas Brandstädt,et al. The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs , 1987, Theor. Comput. Sci..
[2] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..
[3] Richard P. Anstee,et al. Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.
[4] A. Hoffman,et al. Totally-Balanced and Greedy Matrices , 1985 .
[5] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .