scientific article; zbMATH DE number 3906537
From MaRDI portal
Publication:3684157
Recommendations
Cited in
(26)- A note on the interval number of a graph
- ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible
- Interval representations of planar graphs
- Unichain coverings in partial orders with the nested saturation property
- Poset boxicity of graphs
- Trapezoid graphs and their coloring
- The total interval number of a graph
- On the unit interval number of a graph
- Planar graphs and poset dimension
- The interval inclusion number of a partially ordered set
- An interval digraph in relation to its associated bipartite graph
- On claw-free asteroidal triple-free graphs
- Simple games and magic squares
- Intersection number and capacities of graphs
- Kernels of minimum size gossip schemes
- 4-connected triangulations on few lines
- Thicknesses of Ordered Sets
- Finite posets and Ferrers shapes
- On the duality of semiantichains and unichain coverings.
- The complexity of embedding orders into small products of chains
- Order-sensitive domination in partially ordered sets and graphs
- Subtree and substar intersection numbers
- On the Erdős-Szekeres problem for convex permutations and orthogonally convex point sets
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- Dimensions of hypergraphs
- Forms of representation for simple games: sizes, conversions and equivalences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684157)
