On some Graphs with a Unique Perfect Matching
classification
🧮 math.CO
cs.DM
keywords
matchinggraphperfectuniqueclaw-freegraphscharacterizationcograph
read the original abstract
We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free. Furthermore, we provide a constructive characterization of the claw-free graphs with a unique perfect matching.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.