The On-Line Encyclopedia of Bongard Problems

Search: ex:EX8940

Displaying 1-1 of 1 result found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

Each node is connected to the same number of nodes by straight lines vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Regular_graph`
	CROSSREFS	`Any left example of BP1099 will be a left example for this BP.` `Adjacent-numbered pages: BP1096 BP1097 BP1098 BP1099 BP1100 * BP1102 BP1103 BP1104 BP1105 BP1106`
	KEYWORD	`precise, allsorted, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

page 1

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)