论文信息 - Circuits containing specified edges - 字舞流文

Circuits containing specified edges

Abstract Given any l (≥ 2) disjoint edges in a (2 l − 2)-connected graph, there is a circuit containing all of them.

Douglas R. Woodall | D. R. Woodall

[1] D. R. Woodall. The binding number of a graph and its Anderson number , 1973 .

[2] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.