Pages that link to "Item:Q960938"
From MaRDI portal
The following pages link to Regular graphs are not universal fixers (Q960938):
Displaying 5 items.
- Bipartite graphs are not universal fixers (Q998325) (← links)
- Claw-free graphs are not universal fixers (Q998501) (← links)
- On the domination number of permutation graphs and an application to strong fixed points (Q2208341) (← links)
- Recontamination does not help to search a graph (Q5286162) (← links)
- Edgeless graphs are the only universal fixers (Q5496701) (← links)