This article provides some new characterizations for testing if a matroid isgraphic. One of them can be seen as a consequence deduced from the Wu’s theory on theplanarity of graphs.
文摘This article provides some new characterizations for testing if a matroid isgraphic. One of them can be seen as a consequence deduced from the Wu’s theory on theplanarity of graphs.
