On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph.
Louis EsperetGiuseppe MazzuoccoloPublished in: Discret. Math. (2015)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- undirected graph
- directed acyclic graph
- edge weights
- maximum cardinality
- directed edges
- random walk
- bipartite graph
- spectral embedding
- graph theory
- real world graphs
- maximum matching
- graph representation
- graph theoretic
- stable set
- vertex set
- strongly connected components
- structured data
- graph structure
- edge detector
- connected components
- b spline
- maximum number
- equivalence classes
- graph clustering
- graph databases
- graph model
- graph mining
- image structure
- nodes of a graph