On the lower length of the closed-set lattice of a tree

DOI10.1016/0012-365X(94)00090-6zbMath0853.05028OpenAlexW2029349846MaRDI QIDQ1916386

K. S. Poh, Khee Meng Koh

Publication date: 3 December 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00090-6

zbMATH Keywords

latticetreeschainlengthsimple graphidentityclosed setssparse setclosed-set lattice

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Lattices (06B99)

Cites Work

• On an isomorphism problem on the closed-set lattice of a graph
• Vertex-gluings of sensitive graphs
• On a construction of critical graphs which are not sensitive
• On the uniformity 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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