Claw-free graphs are not universal fixers

DOI10.1016/J.DISC.2007.12.053MaRDI QIDQ998501zbMATH OpenOpenAlexFDO

Authors E. J. Cockayne, Richard G. Gibson, Christina M. Mynhardt

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.12.053

zbMATH Keywords

dominationclaw-free graphsprisms of graphsuniversal fixers

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 5556299 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2108147 (Why is no real title available?)
• Bipartite graphs are not universal fixers
• Distance and connectivity measures in permutation graphs
• Fractional domination in prisms
• On diameter of permutation graphs
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs
• Regular graphs are not universal fixers

Cited in

(8)

• Distance 2-domination in prisms of graphs
• Regular graphs are not universal fixers
• Bipartite graphs are not universal fixers
• Edgeless graphs are the only universal fixers.
• Convex universal fixers
• Couterexample to a conjecture on the structure of bipartite partionable graphs
• Graphs with \(C_3\)-free vertices are not universal fixers
• A proof of the universal fixer conjecture

This page was built for publication: Claw-free graphs are not universal fixers

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