Sciweavers

441 search results - page 7 / 89
» Convex Graph Invariants
Sort
View
DAM
2008
92views more  DAM 2008»
13 years 7 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
GBRPR
2011
Springer
12 years 11 months ago
Convexity Grouping of Salient Contours
Convexity represents an important principle of grouping in visual perceptual organization. This paper presents a new technique for contour grouping based on convexity and has the f...
Padraig Corcoran, Peter Mooney, James Tilton
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
13 years 7 months ago
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant
David Emms, Edwin R. Hancock, Simone Severini, Ric...
EJC
2006
13 years 7 months ago
Invariant subspaces, duality, and covers of the Petersen graph
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
Aleksander Malnic, Primoz Potocnik