Title of article :
Eulerian straight ahead cycles in drawings of complete bipartite graphs Original Research Article
Author/Authors :
Heiko Harborth، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
Straight ahead cycles in drawings of graphs pass all vertices leaving the same number of edges on each side. For complete bipartite graphs K2r,2s, drawings with straight ahead Eulerian cycles and with straight ahead 4-cycles are constructed.
Keywords :
Straight ahead , Complete bipartite graph , Small cycles , Drawings of graphs , Eulerian cycles
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
