Minimum dominating cycles in 2-trees

DOI10.1007/BF00995176MaRDI QIDQ3870930zbMATH OpenFDO

Authors Andrzej Proskurowski

Publication date 1979

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

Full work available at URL https://doi.org/10.1007/BF00995176

zbMATH Keywords

2-treesdirected treesrecursive representationminimum dominating cycles

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3634280 (Why is no real title available?)
• R -Domination in Graphs
• A linear algorithm for the domination number of a tree
• On Spanning and Dominating Circuits in Graphs
• Towards a theory of domination in graphs

Cited in

(12)

• Minimum dominating cycles in outerplanar graphs
• Computation of the center and diameter of outerplanar graphs
• Approximate realizations for outerplanaric degree sequences
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Formulations and algorithms for the simple cycle problem
• Finding minimum dominating cycles in permutation graphs
• Symmetry breaking in planar and maximal outerplanar graphs
• \(H\)-domination in graphs
• Approximate realizations for outerplanaric degree sequences
• Plane Triangulations Without Spanning 2-Trees
• Dominating cycles in Halin graphs
• An optimal algorithm for finding dominating cycles in circular-arc graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870930)