Browsing Mathematics (Faculty of) by Subject "dominating set"
Now showing items 1-3 of 3
-
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
(Elsevier, 2020-11)Let s and t be positive integers. We use Pt to denote the path with t vertices and K1,s to denote the complete bipartite graph with parts of size 1 and s respectively. The one-subdivision of K1,s is obtained by replacing ... -
On Reconfiguration Problems: Structure and Tractability
(University of Waterloo, 2015-02-18)Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph problems. In the classical ... -
Transversal Problems In Sparse Graphs
(University of Waterloo, 2022-09-20)Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family ...