Introduction to Graph Theory · Problem 4.8

Digraphs and multidigraphs — Darij Grinberg

Mathematics — Graph Theory · strong-weak-components

Problem

Let

D

be a multidigraph. Prove that the strong components of

D

are the weak components of

D

if and only if each arc of

D

is contained in at least one cycle.