login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
BP562 There exists a closed trail that hits each vertex exactly once vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Left examples are called "Hamiltonian graphs."

CROSSREFS

Adjacent-numbered pages:
BP557 BP558 BP559 BP560 BP561  *  BP563 BP564 BP565 BP566 BP567

KEYWORD

math, traditional

CONCEPT graph (info | search),
distinguishing_crossing_curves (info | search)

WORLD

connected_graph [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary