论文信息 - Minimum cycle bases of Halin graphs

Minimum cycle bases of Halin graphs

Halin graphs are planar 3-connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003

P. Stadler

[1] S. Lane. A structural characterization of planar combinatorial graphs , 1937 .

[2] Morris Plotkin,et al. Mathematical Basis of Ring-Finding Algorithms in CIDS , 1971 .

[3] Wai-Kai Chen. On Vector Spaces Associated with a Graph , 1971 .

[4] Andrzej Proskurowski,et al. On Halin graphs , 1983 .

[5] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..

[6] Maciej M. Syslo,et al. Dominating cycles in halin graphs , 1990, Discret. Math..

[7] David Hartvigsen,et al. When Do Short Cycles Generate the Cycle Space? , 1993, J. Comb. Theory, Ser. B.

[8] David Hartvigsen,et al. The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs , 1994, SIAM J. Discret. Math..

[9] Philippe Vismara,et al. Union of all the Minimum Cycle Bases of a Graph , 1997, Electron. J. Comb..

[10] Terry A. McKee. Induced cycle structure and outerplanarity , 2000, Discret. Math..

[11] Peter F. Stadler,et al. Interchangeability of Relevant Cycles in Graphs , 2000, Electron. J. Comb..