On the Galois lattice of bipartite distance hereditary graphs
From MaRDI portal
Publication:2352777
DOI10.1016/j.dam.2015.03.014zbMath1316.05033OpenAlexW2003357593MaRDI QIDQ2352777
Massimiliano Caramia, Nicola Apollonio, Paolo Giulio Franciosa
Publication date: 6 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.03.014
Structural characterization of families of graphs (05C75) Complemented lattices, orthocomplemented lattices and posets (06C15)
Related Items
On computing the Galois lattice of bipartite distance hereditary graphs, Indiscernibility structures induced from function sets : Graph and digraph case, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, Simplicial complexes and closure systems induced by indistinguishability relations, Representing attribute reduction and concepts in concept lattice using graphs, New perspectives of granular computing in relation geometry induced by pairings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Crown-free lattices and their related graphs
- Treelike comparability graphs
- Laminar structure of ptolemaic graphs with applications
- Distance-hereditary graphs
- On hypergraph acyclicity and graph chordality
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- A Peep through the Looking Glass: Articulation Points in Lattices
- Degrees of acyclicity for hypergraphs and relational database schemes
- The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices
- Trees in Concept Lattices
- Lattices with Doubly Irreducible Elements
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Restricted unimodular chordal graphs
- Graph Classes: A Survey
- Dismantlable Lattices in the Mirror
