We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
The body-brain coevolution of aerial life forms has not been developed as far as aquatic or terrestrial locomotion in the field of artificial life. We are studying physically simu...
Under multi-homing an Internet Service Provider (ISP) connects to the Internet via multiplicity of network providers. This allows the provider to receive proper quality of service...
The avian retino-tecto-rotundal pathway plays a central role in motion analysis and features complex connectivity. Yet, the relation between the pathway's structural arrangeme...
Alireza S. Mahani, Reza Khanbabaie, Harald Luksch,...