Graphs in which all maximal bipartite subgraphs have the same order

Wayne Goddard, Kirsti Kuenzel, Eileen Melville

Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite n…