6740 search results - page 224 / 1348 » An s -Hamiltonian Line Graph Problem |
123
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
99
Voted
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
134
Voted
DCC
2005
IEEE
16 years 7 days ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
83
Voted
ASPDAC
1995
ACM
15 years 4 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
88
Voted
WG
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...