Title of article :
Smallest limited snakes in d-grids Original Research Article
Author/Authors :
Heiko Harborth، نويسنده , , Christian Thürmann، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
A limited snake in a graph is a maximal induced path. The smallest order of a limited snake is determined for the cube graph and determined for the graph of the d-dimensional grid.
Keywords :
Maximal induced path , Grid graph , Cube graph
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
