Minimum dominating cycles in 2-trees

DOI10.1007/BF00995176zbMath0433.05039MaRDI QIDQ3870930

Andrzej Proskurowski

Publication date: 1979

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

2-treesdirected treesrecursive representationminimum dominating cycles

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (9)

Computation of the center and diameter of outerplanar graphs ⋮ \(H\)-domination in graphs ⋮ Symmetry breaking in planar and maximal outerplanar graphs ⋮ Dominating cycles in Halin graphs ⋮ Plane Triangulations Without Spanning 2-Trees ⋮ An optimal algorithm for finding dominating cycles in circular-arc graphs ⋮ Minimum dominating cycles in outerplanar graphs ⋮ Finding minimum dominating cycles in permutation graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• A linear algorithm for the domination number of a tree
• R -Domination in Graphs
• On Spanning and Dominating Circuits in Graphs
• Towards a theory of domination in graphs

This page was built for publication: Minimum dominating cycles in 2-trees