Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COMBINATORICS
2000

favoriteEmaildiscussreport

101views more COMBINATORICS 2000»

Bound Graph Polysemy

13 years 4 months ago

Bound Graph Polysemy

Download www.combinatorics.org

Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper bound precisely when the pair is an edge in G1 and a lower bound precisely when it is an edge in G2. We examine several special cases and prove a characterization of the bound polysemic pairs that illuminates a connection with the squared graphs. 2000 Mathematics Subject Classification. Primary 05C62, 06A07.

Paul J. Tanenbaum

Real-time Traffic

Bound Polysemic Pairs | COMBINATORICS 2000 | Shared Vertex | Upper Bound |

claim paper

Related Content

» Testing Hereditary Properties of NonExpanding BoundedDegree Graphs

» Secret Sharing Schemes for Very Dense Graphs

» Bounds on the Geometric Mean of Arc Lengths for BoundedDegree Planar Graphs

» On Universal Graphs of Minor Closed Families

» The Recognition of Tolerance and Bounded Tolerance Graphs

» A Survey of the Algorithmic Properties of Simplicial Upper Bound and Middle Graphs

» ThreeDimensional Grid Drawings with Subquadratic Volume

» Nearly light cycles in embedded graphs and crossingcritical graphs

» Ggraphs for the cage problem a new upper bound

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COMBINATORICS
Authors	Paul J. Tanenbaum

Comments (0)