A proof of the universal fixer conjecture

MaRDI QIDQ4645577zbMATH OpenFDO

Authors Monika Rosicka

Publication date 10 January 2019

zbMATH Keywords

dominating setdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Edgeless graphs are the only universal fixers.
• Claw-free graphs are not universal fixers
• Characterizing Cartesian fixers and multipliers
• Convex universal fixers
• Graphs with C₃-free vertices are not universal fixers

Cited in

(8)

• Convex and weakly convex domination in prism graphs
• Convex universal fixers
• Couterexample to a conjecture on the structure of bipartite partionable graphs
• Graphs with C₃-free vertices are not universal fixers
• Edgeless graphs are the only universal fixers.
• Regular graphs are not universal fixers
• Bipartite graphs are not universal fixers
• Claw-free graphs are not universal fixers

This page was built for publication: A proof of the universal fixer conjecture

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