DSpace at KOASAS
Browsing DSpace

Browse by Subject PLANAR GRAPHS

A to Z

All 0-9

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:

Showing results 1 to 5 of 5

1
Computing a minimum-dilation spanning tree is NP-hard

Cheong, Otfried; Haverkort, Herman; Lee, Mira, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.41, no.3, pp.188 - 205, 2008-11

2
Sparse geometric graphs with small dilation

Aronov, B; de Berg, M; Cheong, Otfried; Gudmundsson, J; Haverkort, H; Vigneron, A, ALGORITHMS AND COMPUTATION BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3827, pp.50 - 59, 2005

3
Strong edge-colorings of sparse graphs with large maximum degree

Choi, Ilkyoo; Kim, Jaehoon; Kostochka, Alexandr V.; Raspaud, Andre, EUROPEAN JOURNAL OF COMBINATORICS, v.67, pp.21 - 39, 2018-01

4
Toroidal graphs containing neither K-5(-) nor 6-cycles are 4-choosable

Choi, Ilkyoo, JOURNAL OF GRAPH THEORY, v.85, no.1, pp.172 - 186, 2017-05

5
Vertex arboricity of toroidal graphs with a forbidden cycle

Choi, Ilkyoo; Zhang, Haihui, DISCRETE MATHEMATICS, v.333, pp.101 - 105, 2014-10

Discover

rss_1.0 rss_2.0 atom_1.0