Sufficient condition for Reed's conjecture

2018/09/24 by Nakanishi, Misa
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1809.08987

Abstract

From the research of several recent papers, we are concerned with domination number in cubic graphs and give a sufficient condition for Reed's conjecture.

Related

• Domination structure for number three
• Counterexamples to the Cubic Graph Domination Conjecture
• A note on Reed's Conjecture about \ω, \Δ and \χ with\n respect to vertices of high degree
• The 1/3-conjectures for domination in cubic graphs
• On Validity of Reed Conjecture for Classes of Graphs with Two Forbidden Subgraphs