0
$\begingroup$

How could I draw a graph that is connected, $3$-regular that has both a cut vertex and a perfect matching? I know every simple $3$-regular graph with no cut-edge has a perfect matching, but not sure how to draw a graph to meet these criteria.

$\endgroup$
1
$\begingroup$

See example below. Edges of one of 4 perfect matchings are marked by red color.

enter image description here

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.