Titlebook: Combinatorial Geometry and Graph Theory; Indonesia-Japan Join Jin Akiyama,Edy Tri Baskoro,Mikio Kano Conference proceedings 2005 Springer-V

马笼头

On Convex Developments of a Doubly-Covered Square,We give an algebraic characterization of all convex polygons that are 2-flat foldable to a square, that is, we determine all shapes of convex developments of a doubly-covered square.

mercenary

Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph,Let . ≥ 7. Then there exists a uniform covering of 2-paths with 6-paths in . . if and only if . ≡ 0,1,2 (mod 5).

吸气

Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles,To . a regular .-gon into a convex polyhedron is to form the polyhedron by gluing portions of the perimeter of the .-gon together, . the .-gon is a net of the polyhedron. In this paper we identify all convex polyhedra which are foldable from an equilateral triangle.

ASTER

Crossing Numbers and Skewness of Some Generalized Petersen Graphs,The . of a graph . is the minimum number of edges in . whose removal results in a planar graph. In this paper, we show that the skewness of the generalized Petersen graph . (3., .) is ., where . ≥ 4. As a byproduct, it is shown that for . ≥ 4, ., where . (.) denotes the crossing number of ..

左右连贯

外向者

不开心

幻想

全国性

Infraction

Ursula Krämer,Tamara Schikowskid matching of a graph is known to be NP-hard. In random .-regular graphs, the problem of finding a maximum induced matching has been studied for . ∈ {3, 4, ..., 10 }. This was due to Duckworth et al.(2002) where they gave the asymptotically almost sure lower bounds and upper bonds on the size of max