Nicola Lorenz, A Minor Characterisation of Normally Spanned Sets of Vertices
A rooted spanning tree of a graph $G$ is called normal if the endvertices of all edges of $G$ are comparable in the tree order. It is well known that …
1 event found.
기초과학연구원 이산수학그룹