Shude Long
Abstract
This article first uses the matroid language to difine the new concepts of graph as the new concepts of matroid, and then we use the matroid language to translate the new results which Goddyn and Heuvel have attained in graph into the new results of matroid. Last, we will prove these new results by the method of matroid.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article first uses the matroid language to difine the new concepts of graph as the new concepts of matroid, and then we use the matroid language to translate the new results which Goddyn and Heuvel have attained in graph into the new results of matroid. Last, we will prove these new results by the method of matroid.
Key concepts: Matroid, Matroid partitioning, Graphic matroid, Oriented matroid, Weighted matroid, Combinatorics, Mathematics, Discrete mathematics