Forbidden subgraphs for constant domination number

zbMATH Open1401.05217arXiv1803.03913MaRDI QIDQ4560243FDOQ4560243

Authors: Michitaka Furuya 

Publication date: 10 December 2018

Abstract: In this paper, we characterize the sets $mathcalH$ of connected graphs such that there exists a constant $c=c(mathcalH)$ satisfying $gamma(G)leqc$ for every connected $mathcalH$-free graph $G$, where $gamma(G)$ is the domination number of $G$.

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

Recommendations

• scientific article; zbMATH DE number 3873384
• On graphs for which the connected domination number is at most the total domination number
• On graphs with equal domination and connected domination numbers
• A proof of a conjecture on the connected domination number
• scientific article; zbMATH DE number 2188424

zbMATH Keywords

domination numberRamsey numberforbidden induced subgraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Cited In (4)

• Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
• A Ramsey-type theorem for the matching number regarding connected graphs
• Ramsey-type results for path covers and path partitions. II: Digraphs
• Ramsey-type results for path covers and path partitions

This page was built for publication: Forbidden subgraphs for constant domination number

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