Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00552108n
Noun Concept
Categories: Matroid theory, Graph families, Graph theory objects
EN
pseudoforest  1-forest  1-tree  bicycle  directed pseudoforest
EN
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. Wikipedia
Undirected graph in which every connected component has at most one cycle Wikidata
An undirected graph in which every connected component has at most one cycle. Wiktionary
IS A
undirected graph
HAS KIND
bicircular matroid
STUDIED BY
graph theory
Wikipedia
EN
pseudoforest
Wikidata
EN
pseudoforest
Wiktionary
EN
pseudoforest
Wikipedia Redirections
EN
1-forest, 1-tree, bicycle (graph theory), directed pseudoforest, functional graph, maximal pseudoforest, Near-tree, pseudoarboricity, pseudotree, spanning pseudoforest, unicyclic graph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License