LAUSR

Vertex disjoint cycles in intersection graphs of bases of matroids

Sign Up to like & get
recommendations!
1 Published in 2017 at "Wuhan University Journal of Natural Sciences"

DOI: 10.1007/s11859-017-1273-y

Abstract: The intersection graph of bases of a matroid M=(E, B) is a graph G=GI (M) with vertex set V(G) and edge set E(G) such that V(G)=B(M) and E(G)={BB′: |B ∩ B′|≠0, B, B′∈ B(M), where… read more here.

Keywords: intersection; cycles intersection; graphs bases; disjoint cycles ... See more keywords