On the uniformity of the closed-set lattice of a tree

DOI10.1016/0012-365X(86)90028-2zbMath0594.05027OpenAlexW1985671119MaRDI QIDQ1076680

K. S. Poh, Khee Meng Koh

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90028-2

zbMATH Keywords

treemaximal chainfinite latticelower lengthupper length

Mathematics Subject Classification ID

Trees (05C05) Lattices (06B99)

Related Items (3)

On the lower length of the closed-set lattice of a tree ⋮ Products of graphs with their closed-set lattices ⋮ Constructions of sensitive graphs which are not strongly sensitive

Cites Work

• On an isomorphism problem on the closed-set lattice of a graph
• On the grading numbers of direct products of chains
• On a construction of critical graphs which are not sensitive
• Unnamed Item
• Unnamed Item

This page was built for publication: On the uniformity of the closed-set lattice of a tree