136 search results - page 5 / 28 » On Touching Triangle Graphs |
92
Voted
AGTIVE
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A...
KDD
2008
ACM
16 years 16 hour ago
2008
ACM
WG
2010
Springer
14 years 10 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
DM
2008
14 years 11 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
109
click to vote
SIAMDM
2010
14 years 10 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...