Why only BFS and DFS

BFS and DFS are the principal algorithms to search for specific nodes in a graph. It's either making a step in each direction or searching in a single direction as long as possible. Algos like UCS, IDDFS and Bidirectional Search are either evolutions of the two basic ones or have some kind of information about paths and nodes (e.g. cost)
So, in case of an "open canvas" with no info, BFS and DFS are the primordial algorithms