Contents

Ars Combinatoria

  • Research article

Bipartite Analogues of Split Graphs and Related Topics

Howard B. Frost1, Michael S. Jacobson2, Jerald A. Kabell3, F.R. MeMorris2
1 Department of Mathematics University of Arizona Tucson, AZ 85721
2 Department of Mathematics University of Louisville Louisville, KY 40292
3Department of Computer Science Central Michigan University Mt. Pleasant, MI 48859
  • Published: 30/06/1990

Abstract

Following up on the bipartite analogue of an interval graph developed in a previous work, we investigate several possibilities for a bipartite analogue of the concept of a split graph. We also give bipartite analogues of threshold graphs and of perfect graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Howard B. Frost, Michael S. Jacobson, Jerald A. Kabell, F.R. MeMorris. Bipartite Analogues of Split Graphs and Related Topics[J], Ars Combinatoria, Volume 029. 283-288. DOI: .