Pages that link to "Item:Q1237785"
From MaRDI portal
The following pages link to Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785):
Displaying 50 items.
- A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Representing preferences using intervals (Q646529) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- Dimension preserving contractions and a finite list of 3-irreducible posets (Q766141) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- New characterizations of proper interval bigraphs (Q896097) (← links)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- On orthogonal ray trees (Q908312) (← links)
- On the dimension of the Cartesian product of relations and orders (Q912876) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- The dimension of the Cartesian product of partial orders (Q1061151) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- Circular-arc graphs with clique cover number two (Q1078197) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- A characterization of Robert's inequality for boxicity (Q1132899) (← links)
- A generalization of Turan's theorem to directed graphs (Q1143405) (← links)
- Large minimal realizers of a partial order. II (Q1148925) (← links)
- A structure theory for ordered sets (Q1151913) (← links)
- Stacks and splits of partially ordered sets (Q1160199) (← links)
- A combinatorial problem involving graphs and matrices (Q1169462) (← links)
- The interval inclusion number of a partially ordered set (Q1176729) (← links)
- Permutation statistics and linear extensions of posets (Q1177948) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension (Q1229735) (← links)
- On the complexity of posets (Q1235192) (← links)
- Interval hypergraphs and D-interval hypergraphs (Q1237993) (← links)
- Split semiorders (Q1296976) (← links)
- Posets with large dimension and relatively few critical pairs (Q1319081) (← links)
- 3-interval irreducible partially ordered sets (Q1338127) (← links)
- Generalizations of semiorders: A review note (Q1384555) (← links)
- Split orders (Q1422429) (← links)
- Dimension of valued relations (Q1582042) (← links)
- Recent results on containment graphs of paths in a tree (Q1752490) (← links)
- What is reconstruction for ordered sets? (Q1772277) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- On-line algorithms for ordered sets and comparability graphs (Q1894374) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- On \(k\)-tree containment graphs of paths in a tree (Q2035089) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
