6740 search results - page 67 / 1348 » An s -Hamiltonian Line Graph Problem |
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
AUSAI
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has bee...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
CCCG
2007
13 years 9 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...