Minimum cycle bases of Halin graphs

Authors:
Peter F. Stadler
Affiliations:
Bioinformatik, Institut f. Informatik, Universität Leipzig, Kreuzstrasse 7b, D-04103 Leipzig, Germany and Inst. for Theor. Chem. and Struct. Biol., Univ. of Vienna, Austria and The Santa Fe I ...
Venue:
Journal of Graph Theory
Year:
2003

Citing 0
Cited 8

Computing straight-line 3D grid drawings of graphs in linear volume

Computational Geometry: Theory and Applications
The 2-dipath chromatic number of Halin graphs

Information Processing Letters
A 3-approximation for the pathwidth of Halin graphs

Journal of Discrete Algorithms
Minimum cycle bases of direct products of complete graphs

Information Processing Letters
Computing straight-line 3D grid drawings of graphs in linear volume

Computational Geometry: Theory and Applications
Minimum Cycle Bases of Weighted Outerplanar Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minimum cycle bases of weighted outerplanar graphs

Information Processing Letters
On backbone coloring of graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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