Characterization problems for graphs, partially ordered sets, lattices, and families of sets
From MaRDI portal
Publication:1237785
DOI10.1016/S0012-365X(76)80011-8zbMATH Open0356.06007OpenAlexW2068654529WikidataQ106106673 ScholiaQ106106673MaRDI QIDQ1237785FDOQ1237785
John I. jun. Moore, William T. Trotter
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(76)80011-8
Cites Work
- Title not available (Why is that?)
- Intransitive indifference with unequal indifference intervals
- Representation of a finite graph by a set of intervals on the real line
- Transitiv orientierbare Graphen
- A Characterization of Comparability Graphs and of Interval Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial orders of dimension 2
- Characterizing circular-arc graphs
- Title not available (Why is that?)
- Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
- Faithful Representation of a Family of Sets by a Set of Intervals
- Inequalities in Dimension Theory for Posets
- Dimension of the crown \(S^k_n\)
- Some theorems on graphs and posets
- Planar Lattices
- Title not available (Why is that?)
- Crowns, Fences, and Dismantlable Lattices
- Structure theorems for some circular-arc graphs
- Matrix characterizations of circular-arc graphs
- Title not available (Why is that?)
- A generalization of Hiraguchi's: Inequality for posets
- Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
- A structure theorem for the consecutive 1's property
- On the complexity of posets
- The Dimension of a Comparability Graph
- Arbres et dimension des ordres
- A forbidden subposet characterization of an order — dimension inequality
- Certain partially ordered sets of dimension three
Cited In (85)
- On the dimension of the Cartesian product of relations and orders
- Representation characterizations of chordal bipartite graphs
- 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
- Large minimal realizers of a partial order. II
- Dimension of valued relations
- 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
- 3-interval irreducible partially ordered sets
- Circular-arc graphs with clique cover number two
- 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
- The complexity of tropical graph homomorphisms
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- Reconstructibility and perfect graphs
- What is reconstruction for ordered sets?
- Two-dimensional partial orderings: Recursive model theory
- Dimensions of hypergraphs
- Split orders
- Dimension and matchings in comparability and incomparability graphs.
- A characterization of Robert's inequality for boxicity
- On the complexity of posets
- On the dimension of partially ordered sets
- The complexity of facets (and some facets of complexity)
- Essential obstacles to Helly circular-arc graphs
- A combinatorial problem involving graphs and matrices
- Permutation statistics and linear extensions of posets
- 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
- The competition hypergraphs of doubly partial orders
- Partial Characterizations of Circular-Arc Graphs
- New characterizations of proper interval bigraphs
- Forbidden substructure for interval digraphs/bigraphs
- Title not available (Why is that?)
- Representation theorems for graphs whose vertex set is partially ordered
- 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
- Representing preferences using intervals
- The interval inclusion number of a partially ordered set
- Dimension preserving contractions and a finite list of 3-irreducible posets
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Partial Characterizations of 1‐Perfectly Orientable Graphs
- Efficient parallel recognition of some circular arc graphs. I
- Interval dimension is a comparability invariant
- The Complexity of the Partial Order Dimension Problem
- Circular-arc hypergraphs: rigidity via connectedness
- A generalization of Turan's theorem to directed graphs
- Circular representation problem on hypergraphs
- A generalization of the theorem of Lekkerkerker and Boland
- Finite dimensional scattered posets
- 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
- On a certain numbering of the vertices of a hypergraph
- A characterization of two-agent Pareto representable orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lexicographic Orientation Algorithms
- 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
- Block Crossings in Storyline Visualizations
- The granular partition lattice of an information table
- Vertex deletion into bipartite permutation graphs
- Hypergraphs and intervals
- Characterising circular-arc contact \(B_0\)-VPG graphs
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
- Properties of Large 2-Crossing-Critical Graphs
- Hereditary semiorders and enumeration of semiorders by dimension
- A type of algebraic structure related to sets of intervals
- Dimension of restricted classes of interval orders
- Title not available (Why is that?)
- Vertex deletion into bipartite permutation graphs
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)
