Simultaneously dominating all spanning trees of a graph

DOI10.5614/ejgta.2022.10.1.5zbMath1487.05196arXiv1810.12887OpenAlexW2946136279MaRDI QIDQ5081207

Sebastian S. Johann, Manuel Streicher, Sven O. Krumke

Publication date: 14 June 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.12887

zbMATH Keywords

dominating setfactor dominationsimultaneous domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simultaneous domination in graphs
• The strong perfect graph theorem
• A survey of selected recent results on total domination in graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Geometric algorithms and combinatorial optimization
• A partial k-arboretum of graphs with bounded treewidth
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Independent domination in graphs: A survey and recent results
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• Simultaneous graph parameters: factor domination and factor total domination
• Factor domination in graphs
• Graph Theory
• Graphentheoretische Konzepte und Algorithmen

This page was built for publication: Simultaneously dominating all spanning trees of a graph