Gallivan, 1985 - Google Patents
Disjoint edge paths between given vertices of a convex polytopeGallivan, 1985
View PDF- Document ID
- 960841167089524956
- Author
- Gallivan S
- Publication year
- Publication venue
- Journal of Combinatorial Theory, Series A
External Links
Snippet
Disjoint Edge Paths between Given Vertices of a Convex Polytope Page 1 JOURNAL OF
COMBINATORIAL THEORY,&~~~SA 39, 112-115 (1985) Note Disjoint Edge Paths between
Given Vertices of a Convex Polytope S. GALLIVAN Transport Studies Group, Department of …
- 238000010586 diagram 0 abstract description 15
Classifications
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03K—PULSE TECHNIQUE
- H03K3/00—Circuits for generating electric pulses; Monostable, bistable or multistable circuits
- H03K3/02—Generators characterised by the type of circuit or by the means used for producing pulses
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Venkatasubramanian et al. | Local bifurcations and feasibility regions in differential-algebraic systems | |
Stanley | Cohen-macaulay complexes | |
Li et al. | Unpaired many-to-many disjoint path covers on bipartite k-ary n-cube networks with faulty elements | |
Hofbauer | A unified approach to persistence | |
Gallivan | Disjoint edge paths between given vertices of a convex polytope | |
Foisy | A newly recognized intrinsically knotted graph | |
Tucker | The number of groups of a given genus | |
Iwano et al. | Planarity testing of doubly periodic infinite graphs | |
Cattaneo | Fuzzy extension of rough sets theory | |
Bilardi et al. | Characterization of associative operations with prefix circuits of constant depth and linear size | |
Brzozowski et al. | Combinational static CMOS networks | |
García-Ferreira et al. | Some generalizations of rapid ultrafilters in topology and Id-fan tightness | |
Hedenstierna et al. | Comments on" A module generator for optimized CMOS buffers | |
Lu | A safe single-phase clocking scheme for CMOS circuits | |
Cai et al. | Degree-bounded spanners | |
Dutra | Nielsen equivalence in triangle groups | |
Shakeri et al. | Pointwise amenability for dual Banach algebras | |
Davydov et al. | On almost interpolation by multivariate splines | |
Altman | Contractors, approximate identities and factorization in Banach algebras | |
RU2808782C1 (en) | Self-timed single-digit ternary adder with single spacer | |
Floyd | The number of cells in a non-bounding manifold | |
Sun et al. | The Minimum Size of a Graph with Given Tree Connectivity | |
Kalfagianni | Power series link invariants and the Thurston norm | |
Dahlhaus | Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs | |
Choukhmane et al. | An approximation algorithm for the maximum independent set problem in cubic planar graphs |