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

DOI10.1007/BF00383605MaRDI QIDQ761474zbMATH OpenOpenAlexFDO

Authors K. S. Poh, K. M. 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)

Recommendations

• scientific article; zbMATH DE number 3918425
• On the lattice isomorphism problem
• The isomorphism problem for classes of graphs closed under contraction
• On lattices determined up to isomorphisms by their graphs
• scientific article; zbMATH DE number 3815
• scientific article; zbMATH DE number 91017
• scientific article; zbMATH DE number 568812
• scientific article; zbMATH DE number 3929071
• On the isomorphism problem for finite Cayley graphs of bounded valency
• scientific article; zbMATH DE number 3856426

Cited in

(8)

• scientific article; zbMATH DE number 4066955 (Why is no real title available?)
• Some classifications of graphs with respect to a set adjacency relation
• Products of graphs with their closed-set lattices
• Constructions of sensitive graphs which are not strongly sensitive
• On the lower length of the closed-set lattice of a tree
• scientific article; zbMATH DE number 91017 (Why is no real title available?)
• On a construction of critical graphs which are not sensitive
• On the uniformity of the closed-set lattice of a tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761474)