yields True if the edge list elist is an independent edge set of the graph g, and False otherwise.


  • An independent edge set is a set of edges that are never incident to the same vertex.
  • An independent edge set is also known as a matching.
  • IndependentEdgeSetQ works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Introduced in 2010
| Updated in 2014
Translate this page: