Acyclic matching in some subclasses of graphs

A subset M⊆E of edges of a graph G=(V,E) is called a matching if no two edges of M share a common vertex. Given a matching M in G, a vertex v∈V is called M-saturated if there exists an edge e∈M incident with v. A matching M of a graph G is called an acyclic matching if, G[V(M)], the subgraph of G in...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 943; pp. 36 - 49
Main Authors:	Panda, B.S., Chaudhary, Juhi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 17.01.2023
Subjects:	[formula omitted]-completeness Acyclic matching Graph algorithms Matching Polynomial-time algorithms Matching Polynomial-time algorithms Acyclic matching Graph algorithms NP-completeness APX-completeness
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!