Bipartite graphs are not universal fixers

DOI10.1016/J.DISC.2007.11.006zbMath1181.05068OpenAlexW1969337449MaRDI QIDQ998325

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

bipartite graphsdominationprisms of graphsuniversal fixers

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Distance and connectivity measures in permutation graphs
• On diameter of permutation graphs
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs

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