Discrete Mathematics
图分解
Graph DecompositionA graph decomposition is a partition of the edges (or vertices) of a given graph into a collection of subgraphs that satisfy specific properties. / 图分解是将给定图的边（或顶点）划分为满足特定性质的子图集合的过程。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-11-05 21:06:02
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
graph: The original graph being decomposedsubgraph: The resulting components of the decompositiondegree condition: A constraint on the degrees of vertices in the original graph
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsPartial degree conditions for decomposing graphsOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Graph Decomposition.
Node update feedback
review required