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

思想靈活

Excision Techniques and Materials,ally symmetric convex body . of area 1, we can place two internally disjoint .-gons of equal area such that the sum of their areas is at least .. We conjecture that this result is true for any convex bodies.

確定無疑

Ursula Kr?mer,Tamara Schikowski., we will show the asymptotically almost sure existence of an induced matching of certain size in random .-regular graphs, for . ∈ {3,4, 5}. This result improves the known asymptotically almost sure lower bound obtained by Duckworth et al.(2002).

公豬

不幸的人

Budget

Inferior

Maximum Induced Matchings of Random Regular Graphs,d 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

水汽

Antimagic Valuations for the Special Class of Plane Graphs,he label of a face and the labels of the vertices and edges surrounding that face all together add up to the weight of that face. These face weights then form an arithmetic progression with common difference ..

grovel

開頭

Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs, .. Not all graphs are unit distance graphs. However, if every edge of a graph is subdivided by inserting a new vertex, then the resulting graph is a unit-distance graph. The minimum number of new vertices to be inserted in the edges of a graph . to obtain a unit-distance graph is called the ., deno

火海