pseudoforest
undirected graph in which every connected component has at most one cycle
Facts
4 properties- Instance of
- minor-closed graph class
- Subclass of
- undirected graph, sparse graph, outerplanar graph, matchstick graph, uniquely embeddable graph[3][4][5][6][7]
- Studied by
- graph theory[8]
🏷️ Also known as
en pseudoforest
cs pseudoles
de Pseudowald
fr pseudo-forêt
he פסאודויער
he גרף פסאודו-יער
he פסאודו יער
hu pszeudoerdő
ja 擬森
pt pseudofloresta
ro pseudopădure
ru псевдолес
uk псевдоліс
🔖 Identifiers · 5
- Freebase ID
- /m/03c7rcc
- KBpedia ID
- Pseudoforest
- MathWorld ID
- Pseudoforest
- Microsoft Academic ID (discontinued)
- 104031475
- Wolfram Language entity code
- Entity["GraphClass", "Pseudoforest"]
🔗 Connections
Subclass of 3
Maintained by WikiProject 1
Named after 1
Studied by 1
Subtypes 1
Press Enter · cited answer in seconds
0 sources
Summary
pseudoforest is a minor-closed graph class[1].