Justin Kelm

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In(More)
  • 1