Characterization problems for graphs, partially ordered sets, lattices, and families of sets
From MaRDI portal
(Redirected from Publication:1237785)
Cites work
- scientific article; zbMATH DE number 3172312 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- scientific article; zbMATH DE number 3318560 (Why is no real title available?)
- scientific article; zbMATH DE number 3318593 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A forbidden subposet characterization of an order — dimension inequality
- A generalization of Hiraguchi's: Inequality for posets
- A structure theorem for the consecutive 1's property
- Arbres et dimension des ordres
- Certain partially ordered sets of dimension three
- Characterizing circular-arc graphs
- Crowns, Fences, and Dismantlable Lattices
- Dimension of the crown \(S^k_n\)
- Faithful Representation of a Family of Sets by a Set of Intervals
- Inequalities in Dimension Theory for Posets
- Intransitive indifference with unequal indifference intervals
- Matrix characterizations of circular-arc graphs
- Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
- On the complexity of posets
- Partial orders of dimension 2
- Planar Lattices
- Representation of a finite graph by a set of intervals on the real line
- Some theorems on graphs and posets
- Structure theorems for some circular-arc graphs
- The Dimension of a Comparability Graph
- Transitiv orientierbare Graphen
Cited in
(85)- On the dimension of the Cartesian product of relations and orders
- Vertex deletion into bipartite permutation graphs
- Representation characterizations of chordal bipartite graphs
- A generalization of the theorem of Lekkerkerker and Boland
- The dimension of the Cartesian product of partial orders
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Interval hypergraphs and D-interval hypergraphs
- On the problem of how to represent a graph taking into account an additional structure
- Finite dimensional scattered posets
- Large minimal realizers of a partial order. II
- Lexicographic orientation algorithms
- Dimension of valued relations
- 3-interval irreducible partially ordered sets
- Co-TT graphs and a characterization of split co-TT graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Circular-arc graphs with clique cover number two
- Partial characterizations of 1-perfectly orientable graphs
- Applications of Ramsey theory
- A characterization of the \(n\)-agent Pareto dominance relation
- Planar graphs and poset dimension
- Generalizations of semiorders: A review note
- Posets with large dimension and relatively few critical pairs
- On orthogonal ray graphs
- Properties of large 2-crossing-critical graphs
- Subclasses of circular-arc bigraphs: Helly, normal and proper
- Recent results on containment graphs of paths in a tree
- On-line algorithms for ordered sets and comparability graphs
- The complexity of tropical graph homomorphisms
- On a certain numbering of the vertices of a hypergraph
- A characterization of two-agent Pareto representable orderings
- Reconstructibility and perfect graphs
- Sparsification lower bounds for list \(H\)-coloring
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- scientific article; zbMATH DE number 7551866 (Why is no real title available?)
- What is reconstruction for ordered sets?
- Two-dimensional partial orderings: Recursive model theory
- Dimensions of hypergraphs
- Split orders
- A characterization of Robert's inequality for boxicity
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
- Word-representability of graphs with respect to split recomposition
- Transit functions and pyramid-like binary clustering systems
- On \(k\)-tree containment graphs of paths in a tree
- Dimension and matchings in comparability and incomparability graphs.
- On the complexity of posets
- The complexity of facets (and some facets of complexity)
- Essential obstacles to Helly circular-arc graphs
- On the dimension of partially ordered sets
- Permutation statistics and linear extensions of posets
- Block Crossings in Storyline Visualizations
- A combinatorial problem involving graphs and matrices
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
- On realizable biorders and the biorder dimension of a relation
- Split semiorders
- Vertex deletion into bipartite permutation graphs
- The granular partition lattice of an information table
- New characterizations of proper interval bigraphs
- Forbidden substructure for interval digraphs/bigraphs
- The competition hypergraphs of doubly partial orders
- Partial Characterizations of Circular-Arc Graphs
- Hypergraphs and intervals
- Representation theorems for graphs whose vertex set is partially ordered
- scientific article; zbMATH DE number 7651213 (Why is no real title available?)
- Stacks and splits of partially ordered sets
- Paretian partial orders: the two-agent case
- A recognition algorithm for orders of interval dimension two
- On orthogonal ray trees
- A structure theory for ordered sets
- Two remarks on circular arc graphs
- Some inequalities for orderings of acyclic digraphs
- The interval inclusion number of a partially ordered set
- Representing preferences using intervals
- Dimension preserving contractions and a finite list of 3-irreducible posets
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Characterising circular-arc contact \(B_0\)-VPG graphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- Efficient parallel recognition of some circular arc graphs. I
- Interval dimension is a comparability invariant
- Hereditary semiorders and enumeration of semiorders by dimension
- A type of algebraic structure related to sets of intervals
- Circular-arc hypergraphs: rigidity via connectedness
- The Complexity of the Partial Order Dimension Problem
- Dimension of restricted classes of interval orders
- A generalization of Turan's theorem to directed graphs
- Circular representation problem on hypergraphs
This page was built for publication: Characterization problems for graphs, partially ordered sets, lattices, and families of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237785)
