Cargando…
Acyclic Matching in Some Subclasses of Graphs
A subset [Formula: see text] of edges of a graph [Formula: see text] is called a matching if no two edges of M share a common vertex. A matching M in a graph G is called an acyclic matching if G[V(M)], the subgraph of G induced by the M-saturated vertices of G is acyclic. The Acyclic Matching Proble...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254896/ http://dx.doi.org/10.1007/978-3-030-48966-3_31 |