33 search results - page 1 / 7 » Crossing-critical graphs with large maximum degree |
JCT
2010
13 years 7 months ago
2010
DM
2010
13 years 8 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
PATMOS
2004
Springer
14 years 2 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
COMBINATORICS
2006
13 years 8 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...