Sciweavers

COMBINATORICS
2000

Bound Graph Polysemy

14 years 8 days ago
Bound Graph Polysemy
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
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2000
Where COMBINATORICS
Authors Paul J. Tanenbaum
Comments (0)