Minimum dominating cycles in outerplanar graphs

DOI10.1007/BF00977745zbMath0476.05064OpenAlexW2058403001MaRDI QIDQ3933020

Maciej M. Sysło, Andrzej Proskurowski

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-completenessouterplanar graphsdomination

Mathematics Subject Classification ID

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

Related Items (10)

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

Cites Work

• Minimum dominating cycles in 2-trees
• Unnamed Item
• Unnamed Item

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