Acyclic matchings in graphs of bounded maximum degree
Sign Up to like & getrecommendations! Published in 2022 at "Discrete Mathematics"
DOI: 10.1016/j.disc.2022.112885
Abstract: A matching $M$ in a graph $G$ is acyclic if the subgraph of $G$ induced by the set of vertices that are incident to an edge in $M$ is a forest. We prove that every… read more here.
Keywords: maximum degree; acyclic matchings; graphs bounded; bounded maximum ... See more keywords