25 search results - page 4 / 5 » Algebraic characterization of uniquely vertex colorable grap... |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
COCOON
2003
Springer
14 years 23 days ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
DM
2002
13 years 7 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
DM
1998
13 years 7 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...