2017/11/21 by Misa Nakanishi, Nakanishi, Misa
Mathematics · #Advanced Differential Equations and Dynamical Systems #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Rings, Modules, and Algebras
paper · pdf · doi:10.48550/arxiv.1711.07587
openalex publication_date 2017/11/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
From a research of several recent papers, in the first part, we are concerned with domination number in cubic graphs and give a sufficient condition of Reed's conjecture. In the second part, from a perspective, we study the structure of a minimum dominating set in 3-connected graphs. It is derived from a collection of cycles with length 0 mod 3.