On an isomorphism problem on the closed-set lattice of a graph

DOI10.1007/BF00383605zbMath0556.05059OpenAlexW2051370137MaRDI QIDQ761474

K. S. Poh, Khee Meng Koh

Publication date: 1985

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00383605

zbMATH Keywords

closed-set lattice of a graphcovering graph of a latticecovering graph of a posetStrongly sensitive graphs

Mathematics Subject Classification ID

Graph theory (05C99) Lattices (06B99)

Related Items (5)

On the uniformity of the closed-set lattice of a tree ⋮ 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 ⋮ On a construction of critical graphs which are not sensitive

This page was built for publication: On an isomorphism problem on the closed-set lattice of a graph