Name
Abstract | ||
|---|---|---|
Further research will be done on triangulation partitions. particularly, more careful analysis is made on even triangulation of simply connected domain, and a number of new properties are obtained. Using these new properties, some proof of the theorems on graph theory become easy and simple. For example, using the property an arbitrary planner even triangulation can be expressed as the union of a number of disjoint star domains, one can easily prove the equivalence of the three statement triangulation is even, triangulation is 3-vertex signed and triangulation is 2-triangle signed. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16336-4_69 | INFORMATION COMPUTING AND APPLICATIONS, PT 1 |
Keywords | Field | DocType |
even partition, triangulation, 3-vertex signed | Graph theory,Discrete mathematics,Disjoint sets,Simply connected space,Computer science,Surface triangulation,Planar triangulation,Equivalence (measure theory),Triangulation (social science) | Conference |
Volume | Issue | ISSN |
105 | PART 1 | 1865-0929 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ling Wang | 1 | 0 | 0.34 |
| Dianxuan Gong | 2 | 9 | 5.91 |
| Kaili Wang | 3 | 0 | 0.34 |
| Yuhuan Cui | 4 | 20 | 5.35 |
| Shiqiu Zheng | 5 | 2 | 1.74 |