Sciweavers

990 search results - page 12 / 198
» Sub-Graphs of Complete Graph
Sort
View
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
14 years 1 months ago
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
Javier Esparza, Petr Jancar, Alexander Miller
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
GD
2004
Springer
14 years 26 days ago
Partitions of Complete Geometric Graphs into Plane Trees
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Cam...
ENDM
2002
113views more  ENDM 2002»
13 years 7 months ago
On robust cycle bases
Two types of robust cycle bases are defined via recursively nice arrangements; complete and bipartite complete graphs are shown to have such bases. It is shown that a diagram in a...
Paul C. Kainen
TGC
2010
Springer
13 years 5 months ago
An Algebra of Hierarchical Graphs
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
Roberto Bruni, Fabio Gadducci, Alberto Lluch-Lafue...