Crown-free lattices and their related graphs

DOI10.1007/s11083-010-9183-zzbMath1231.06006OpenAlexW2013034593MaRDI QIDQ651416

François Brucker, Alain Gély

Publication date: 13 December 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9183-z

zbMATH Keywords

strongly chordal graphsdismantlable latticescrown-free lattices

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Structure theory of lattices (06B05)

Related Items (9)

Binary set systems and totally balanced hypergraphs ⋮ On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ Lattice automorphism and zero‐divisor graphs of lattices ⋮ Interval-dismantling for lattices ⋮ Examples of clique closure systems ⋮ An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering ⋮ Totally balanced dissimilarities ⋮ Totally Balanced Formal Context Representation ⋮ On the Galois lattice of bipartite distance hereditary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Characterizations of strongly chordal graphs
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Incidence matrices and interval graphs
• Lattices with Doubly Irreducible Elements

This page was built for publication: Crown-free lattices and their related graphs