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

Revision history for BP1100

Displaying 1-6 of 6 results found. page 1
     Edits shown per page: 25.
BP1100 on 2021-01-29 17:37:12 by Leo Crabbe                approved
REFERENCE

https://en.wikipedia.org/wiki/Graph_theory

https://en.wikipedia.org/wiki/Connectivity_(graph_theory)

CROSSREFS

BP1100 on 2021-01-29 17:17:02 by Leo Crabbe                approved
+DATA

 

EX6506
 

REMOVE

 

EX6527
 

BP1100 on 2021-01-29 17:15:14 by Leo Crabbe                approved
NAME

There is a path between any two nodes vs. not so.

COMMENTS

CROSSREFS

https://en.wikipedia.org/wiki/Graph_theory

https://en.wikipedia.org/wiki/Connectivity_(graph_theory)

AUTHOR

Leo Crabbe

+DATA

 

EX6498
   

EX6527
   

EX6536
   

EX6535
   

EX6532
   

EX6514
 

-DATA

 

EX6517
   

EX8937
   

EX8938
   

EX8939
   

EX8935
   

EX8936
 


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