Sciweavers

29 search results - page 3 / 6
» Cover-Incomparability Graphs of Posets
Sort
View
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 8 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 7 months ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss
JCT
2010
135views more  JCT 2010»
13 years 6 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
CPC
2006
97views more  CPC 2006»
13 years 7 months ago
Homomorphism-Homogeneous Relational Structures
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. The picture is rather diffe...
Peter J. Cameron, Jaroslav Nesetril
EJC
2008
13 years 8 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen