Claw-free graphs are not universal fixers

DOI10.1016/J.DISC.2007.12.053zbMATH Open1219.05116OpenAlexW2060176530MaRDI QIDQ998501FDOQ998501

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

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

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

zbMATH Keywords

dominationclaw-free graphsprisms of graphsuniversal fixers

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On dominating the Cartesian product of a graph and K₂
• Distance and connectivity measures in permutation graphs
• On diameter of permutation graphs
• Title not available (Why is that?)
• On the domination number of prisms of graphs
• Fractional domination in prisms
• Regular graphs are not universal fixers
• Bipartite graphs are not universal fixers
• Title not available (Why is that?)

Cited In (3)

• Regular graphs are not universal fixers
• Couterexample to a conjecture on the structure of bipartite partionable graphs
• Edgeless graphs are the only universal fixers

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)