On the Galois Lattice of Bipartite Distance Hereditary Graphs
From MaRDI portal
Publication:2946040
DOI10.1007/978-3-319-19315-1_4zbMath1365.05244arXiv1406.0154OpenAlexW2568899965MaRDI QIDQ2946040
Massimiliano Caramia, Nicola Apollonio, Paolo Giulio Franciosa
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.0154
Structural characterization of families of graphs (05C75) Complemented lattices, orthocomplemented lattices and posets (06C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Crown-free lattices and their related graphs
- Treelike comparability graphs
- Distance-hereditary graphs
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- On computing the number of linear extensions of a tree
- The arborescence-realization problem
- Degrees of acyclicity for hypergraphs and relational database schemes
- Series - parallel graphs and depth-first search trees
- Trees in Concept Lattices
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Lattices with Doubly Irreducible Elements
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Restricted unimodular chordal graphs
- Dismantlable Lattices in the Mirror
This page was built for publication: On the Galois Lattice of Bipartite Distance Hereditary Graphs