Bipartite graphs are not universal fixers

DOI10.1016/J.DISC.2007.11.006zbMATH Open1181.05068OpenAlexW1969337449MaRDI QIDQ998325FDOQ998325

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.11.006

zbMATH Keywords

dominationbipartite 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

Cited In (3)

• Regular graphs are not universal fixers
• Claw-free graphs are not universal fixers
• Edgeless graphs are the only universal fixers

   Recommendations

• Regular graphs are not universal fixers 👍 👎
• Edgeless graphs are the only universal fixers 👍 👎
• Domination in bipartite graphs 👍 👎
• Claw-free graphs are not universal fixers 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Bipartite graphs are not universal fixers

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