Independent dominating sets in triangle-free graphs

DOI10.1007/s10878-010-9336-4zbMath1245.90134OpenAlexW1975702552MaRDI QIDQ434189

Jeremy Lyle, Wayne Goddard

Publication date: 10 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://aquila.usm.edu/fac_pubs/237

zbMATH Keywords

triangle-freedominating setsindependent domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (8)

A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Independent domination in subcubic graphs of girth at least six ⋮ Domination versus independent domination in cubic graphs ⋮ Independent domination in bipartite cubic graphs ⋮ On independent domination in planar cubic graphs ⋮ Independent domination in subcubic graphs ⋮ Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent domination in triangle-free graphs
• Triangle-free graphs with large independent domination number
• Upper bounds for independent domination in regular graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Independent dominating sets in triangle-free graphs