Dominating cycles in Halin graphs
From MaRDI portal
Publication:1174137
DOI10.1016/0012-365X(90)90362-LzbMath0745.05062MaRDI QIDQ1174137
Maciej M. Sysło, Miroslawa Skowronska
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items (3)
Drawing Halin-graphs with small height ⋮ Boxicity of Halin graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding minimum dominating cycles in permutation graphs
- Minimum dominating cycles in 2-trees
- An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
- Minimum dominating cycles in outerplanar graphs
- Halin graphs and the travelling salesman problem
This page was built for publication: Dominating cycles in Halin graphs