๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Boundary Properties of Well-Quasi-Ordered Sets of Graphs

โœ Scribed by Nicholas Korpelainen, Vadim V. Lozin, Igor Razgon


Book ID
120755368
Publisher
Springer Netherlands
Year
2012
Tongue
English
Weight
381 KB
Volume
30
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Ideals of quasi-ordered sets
โœ Elias David ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer ๐ŸŒ English โš– 180 KB
CAYLEY GRAPHS OF PARTIALLY ORDERED SETS
โœ AFKHAMI, MOJGAN; BARATI, ZAHRA; KHASHYARMANESH, KAZEM ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› World Scientific Publishing Company ๐ŸŒ English โš– 229 KB
Well-quasi-ordered classes of groups
โœ Roger M Bryant ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 883 KB
Zero-divisor graphs of partially ordered
โœ Zhanjun Xue; Sanyang Liu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 448 KB

Let (P, โ‰ค) be a partially ordered set (poset, briefly) with a least element 0 and S โІ P. An element x โˆˆ P is a lower bound of S if s โ‰ฅ x for all s โˆˆ S. A simple graph G(P) is associated to each poset P with 0. The vertices of the graph are labeled by the elements of P, and two vertices x, y are conn