Maximal matchings in graphs with large neighborhoods of independent vertices.
I. RinsmaC. H. C. LittleDouglas R. WoodallPublished in: J. Graph Theory (1990)
Keyphrases
- maximum cardinality
- weighted graph
- minimum weight
- undirected graph
- bipartite graph
- labeled graphs
- independent set
- adjacency matrix
- hamiltonian cycle
- attributed graphs
- directed edges
- graph structure
- spanning tree
- directed graph
- average degree
- planar graphs
- edge weights
- graph theoretic
- graph representation
- graph matching
- random graphs
- maximal cliques
- strongly connected
- graph model
- graph mining
- connected subgraphs
- vertex set
- endpoints
- graph theory
- data structure