12 search results - page 1 / 3 » Triangle-Free Polyconvex Graphs |
69
Voted
ARSCOM
2002
15 years 27 days ago
2002
103
Voted
WG
2010
Springer
14 years 11 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...
124
Voted
SIAMDM
2010
14 years 11 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...
92
Voted
ESA
2004
Springer
15 years 6 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
15 years 22 days ago
1998