Title of article
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Author/Authors
Terry A. McKee، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
231
To page
238
Abstract
Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles (respectively, quadrilaterals). These results motivate a definition of ‘strongly chordal bipartite graphs’, forming a class intermediate between bipartite interval graphs and chordal bipartite graphs.
Keywords
Strongly chordal graphs , Bipartite interval graphs , Chordal graphs , Chordal bipartite graphs
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949450
Link To Document