Forbidden subgraphs for constant domination number
Abstract
In this paper, we characterize the sets H of connected graphs such that there exists a constant c=c(H) satisfying γ (G)≤ c for every connected H-free graph G, where γ (G) is the domination number of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.