Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
121
Triangular embeddings of complete graphs from graceful labellings of paths
, 2006
"... We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 2 2s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 2 2s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct
Common-Face Embeddings of Planar Graphs
, 2001
"... Given a planar graph G and a sequence C1,...,Cq, where each Ci is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i ∈ {1,..., q}, there is a face Fi in the embedding whose boundary contains at least one vertex from each set in Ci. This probl ..."
Abstract
- Add to MetaCart
Given a planar graph G and a sequence C1,...,Cq, where each Ci is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i ∈ {1,..., q}, there is a face Fi in the embedding whose boundary contains at least one vertex from each set in Ci
Planar embedding of planar graphs
- Advances in Computing Research
, 1984
"... Planar embedding with minimal area of graphs on an integer grid is an interesting problem in VLSI theory. Valiant [12] gave an algorithm to construct a planar embedding for trees in linear area, he also proved that there are planar graphs that require quadratic area. We fill in a spectrum between Va ..."
Abstract
-
Cited by 31 (1 self)
- Add to MetaCart
Valiant's results by showing that an Nnode planar graph has a planar-embedding with area O(NF), where F is a bound on the path length from any node to the exterior face. In particular, an outerplanar graph can be embedded without crossings in linear area. This bound is tight, up to constant factors
Existence of polyhedral embeddings of graphs is NP-complete
"... It is proved that the decision problem about existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson. ..."
Abstract
- Add to MetaCart
It is proved that the decision problem about existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson.
Existence of polyhedral embeddings of graphs
- Combinatorica
"... It is proved that the decision problem about the existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson. 1 ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
It is proved that the decision problem about the existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson. 1
The many faces of ocneanu cells
- Nuclear Phys. B
"... We define generalised chiral vertex operators covariant under the Ocneanu “double triangle algebra” A, a novel quantum symmetry intrinsic to a given rational 2-d conformal field theory. This provides a chiral approach, which, unlike the conventional one, makes explicit various algebraic structures e ..."
Abstract
-
Cited by 61 (5 self)
- Add to MetaCart
encountered previously in the study of these theories and of the associated critical lattice models, and thus allows their unified treatment. The triangular Ocneanu cells, the 3j-symbols of the weak Hopf algebra A, reappear in several guises. With A and its dual algebra  one associates a pair of graphs, G
Sampling Eulerian orientations of triangular . . .
, 2007
"... We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian ..."
Abstract
- Add to MetaCart
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian
Hexahedral mesh generation using the embedded Voronoi graph
- In Proceedings of the 7th International Meshing Roundtable
, 1999
"... This work presents a new approach for automatic hexahedral meshing, based on the embedded Voronoi graph. The embedded Voronoi graph contains the full symbolic information of the Voronoi diagram and the medial axis of the object, and a geometric approximation to the real geometry. The embedded Vorono ..."
Abstract
-
Cited by 30 (0 self)
- Add to MetaCart
volume, even if its medial axis is degenerate. The embedded Voronoi graph provides complete information regarding proximity and adjacency relationships between the entities of the volume. Hence, decomposition faces are determined unambiguously, without any further geometric computations. The sub
Planar Embeddings with Small and Uniform Faces
, 2014
"... Motivated by finding planar embeddings that lead to drawings with fa-vorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We pro ..."
Abstract
- Add to MetaCart
Motivated by finding planar embeddings that lead to drawings with fa-vorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We
Results 1 - 10
of
121
