login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: ex:EX6497
Displaying 1-1 of 1 result found.     page 1
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP560 There exists a closed trail that hits each edge exactly once vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Left examples are called "Eulerian graphs."


A connected graph is Eulerian if and only if each vertex is incident to an even number of edges.

CROSSREFS

Adjacent-numbered pages:
BP555 BP556 BP557 BP558 BP559  *  BP561 BP562 BP563 BP564 BP565

KEYWORD

precise, allsorted, math, traditional, preciseworld

CONCEPT graph (info | search),
distinguishing_crossing_curves (info | search),
all (info | search),
even_odd (info | search),
existence (info | search)

WORLD

connected_graph [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

    page 1

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