The On-Line Encyclopedia of Bongard Problems

Search: ex:EX7615

Displaying 1-1 of 1 result found.

page 1

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

Graph can be redrawn such that no edges intersect vs. not so.

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

	COMMENTS	`A graph is a collection of vertices and edges. Vertices are the dots and edges are the lines that connect the dots. On the left, all edges can be redrawn (curved lines are allowed and moving vertices is allowed) such that no edges cross each other and each vertex is still connected to the same other vertices. These graphs are called planar.`
	CROSSREFS	`Adjacent-numbered pages: BP900 BP901 BP902 BP903 BP904 * BP906 BP907 BP908 BP909 BP910`
	KEYWORD	`nice, precise, allsorted, notso, math, left-null, preciseworld`
	CONCEPT	`graph (info \| search),` `topological_transformation (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Molly C Klenzak`

page 1

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