Minimum dominating cycles in outerplanar graphs

DOI10.1007/BF00977745MaRDI QIDQ3933020zbMATH OpenOpenAlexFDO

Authors Andrzej Proskurowski, Maciej M. Sysło

Publication date 1981

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

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

zbMATH Keywords

NP-completenessdominationouterplanar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3614802 (Why is no real title available?)
• Minimum dominating cycles in 2-trees

Cited in

(11)

• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• In-trees and plane embeddings of outerplanar graphs
• Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Formulations and algorithms for the simple cycle problem
• Finding minimum dominating cycles in permutation graphs
• Interior graphs of maximal outerplane graphs
• Dominating cycles in Halin graphs
• An optimal algorithm for finding dominating cycles in circular-arc graphs
• Halin graphs and the travelling salesman problem

This page was built for publication: Minimum dominating cycles in outerplanar graphs

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