Unicyclic graph: различия между версиями

A connected graph with <math>n</math> vertices and <math>n</math> edges containing exactly one cycle. Notice that a '''unicyclic graph''' has a '' treewidth'' at most 2.