Olga I. Zverovich

Learn More
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs. Let G be a graph. The neighborhood of a vertex x ∈ V (G) is the set N G (x) = N (x) of all vertices in G that adjacent to x. If vertices x and y of G are adjacent (respectively, non-adjacent), we shall use notation x ∼(More)
  • 1