Convex universal fixers

DOI10.7151/DMGT.1631zbMATH Open1297.05182OpenAlexW2052864590MaRDI QIDQ2866423FDOQ2866423

Authors: Magdalena Lemańska, Rita Zuazua 

Publication date: 13 December 2013

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1631

Recommendations

• Edgeless graphs are the only universal fixers.
• A proof of the universal fixer conjecture
• Couterexample to a conjecture on the structure of bipartite partionable graphs
• Claw-free graphs are not universal fixers
• Graphs with \(C_3\)-free vertices are not universal fixers

zbMATH Keywords

dominating setsconvex setsuniversal fixers

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (05C99) General convexity (52A99)

Cited In (6)

• Distance 2-domination in prisms of graphs
• Edgeless graphs are the only universal fixers.
• The convex and weak convex domination number of convex polytopes
• Graphs with \(C_3\)-free vertices are not universal fixers
• Convex and weakly convex domination in prism graphs
• A proof of the universal fixer conjecture

This page was built for publication: Convex universal fixers

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