Login / Signup
A short proof of Nash-Williams' theorem for the arboricity of a graph.
Boliong Chen
Makoto Matsumoto
Jianfang Wang
Zhongfu Zhang
Jianxun Zhang
Published in:
Graphs Comb. (1994)
Keyphrases
</>
interactive theorem proving
graph theory
random walk
graph structure
directed graph
von neumann
graph model
graph representation
graph theoretic
game theory
bipartite graph
nash equilibrium
theorem proving
theorem prover
graph structures
graph clustering
graph partitioning
cooperative
pairwise