Detail Cantuman
Pencarian Spesifik
E Book
Combinatorial Geometry and Graph Theory
On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.
Ketersediaan
Tidak ada salinan data
Informasi Detail
| Judul Seri |
-
|
|---|---|
| No. Panggil |
-
|
| Penerbit | : ., |
| Deskripsi Fisik |
VIII, 227 p.online resource.
|
| Bahasa |
English
|
| ISBN/ISSN |
9783540305408
|
| Klasifikasi |
006.6
|
| Tipe Isi |
-
|
| Tipe Media |
-
|
|---|---|
| Tipe Pembawa |
-
|
| Edisi |
1st ed. 2005.
|
| Subjek | |
| Info Detail Spesifik |
-
|
| Pernyataan Tanggungjawab |
edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano.
|
Versi lain/terkait
Tidak tersedia versi lain
Informasi
Akses Katalog Publik Daring - Gunakan fasilitas pencarian untuk mempercepat penemuan data katalog






