12 search results - page 1 / 3 » Triangle-Free Polyconvex Graphs |
ARSCOM
2002
13 years 6 months ago
2002
WG
2010
Springer
13 years 4 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...
SIAMDM
2010
13 years 4 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...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
COMBINATORICS
1998
13 years 6 months ago
1998