Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Authors:
Terry A. McKee
Affiliations:
Department of Mathematics and Statistics, Wright State University, Dayton, OH
Venue:
Discrete Mathematics
Year:
2003

Citing 4
Cited 1

On the null-homotopy of bridged graphs

European Journal of Combinatorics
Recognizing interval digraphs and interval bigraphs in polynomial time

Discrete Applied Mathematics
A characterization of strongly chordal graphs

Discrete Mathematics
Strong clique trees, neighborhood trees, and strongly chordal graphs

Journal of Graph Theory

Note: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

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.