Chains, antichains, and fibres
From MaRDI portal
Publication:1098863
DOI10.1016/0097-3165(87)90029-XzbMath0637.06001MaRDI QIDQ1098863
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Partial orders, general (06A06) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items (27)
Fibres of width 3 ordered sets ⋮ Clique-coloring claw-free graphs ⋮ Subgraph transversal of graphs ⋮ Trees as semilattices ⋮ Cutsets and anti-chains in linear lattices ⋮ On covering all cliques of a chordal graph ⋮ Clique-transversal number of graphs whose clique-graphs are trees ⋮ Optimal Sets of Questions for Twenty Questions ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Two-colouring all two-element maximal antichains ⋮ Algorithmic aspects of clique-transversal and clique-independent sets ⋮ Fibres and ordered set coloring ⋮ Bounds on the clique-transversal number of regular graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ Minimum sized fibres in distributive lattices ⋮ Covering the cliques of a graph with vertices ⋮ Distance-hereditary graphs are clique-perfect ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly ⋮ On the treatment of incomparability in ordering semantics and premise semantics ⋮ Obituary: Ivan Rival ⋮ Packing and covering k-chain free subsets in Boolean lattices ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ On the clique-transversal number of chordal graphs ⋮ On ordered sets without 2-colourings ⋮ Clique-transversal sets of line graphs and complements of line graphs ⋮ Hitting all maximal independent sets of a bipartite graph
Cites Work
- Unnamed Item
- Antichain cutsets
- Finite cutsets and finite antichains
- A companion to Grillet's theorem on maximal chains and antichains
- The length, the width and the cutset-number of finite ordered sets
- Compact Spaces and Spaces of Maximal Complete Subgraphs
- Antichains and Finite Sets that Meet all Maximal Chains
- Maximal chains and antichains
- Partially Ordered Sets
This page was built for publication: Chains, antichains, and fibres