Recommendations
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 K2
- 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)