15254 search results - page 40 / 3051 » A k |
COMBINATORICS
2006
14 years 9 months ago
2006
![Characterization of [1, k]-Bar Visibility Trees](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/characterization_of_1_k_bar_visibility_trees_COMBINATORICS_2006.jpg "Characterization of [1, k]-Bar Visibility Trees")
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if th...
58
Voted
ENDM
2006
14 years 9 months ago
2006
We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...
ENTCS
2006
14 years 9 months ago
2006
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
DAM
2002
14 years 9 months ago
2002
For a positive integer k, a k-subdominating function of a graph G = (V; E) is a function f : V {-1; 1} such that uNG[v] f(u)
SIAMCOMP
1998
14 years 9 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...