Dually chordal graphs
From MaRDI portal
Publication:6143980
DOI10.1007/3-540-57899-4_56zbMath1528.68278OpenAlexW1485054218MaRDI QIDQ6143980
Victor Chepoi, Andreas Brandstädt, Vitaly I. Voloshin, Feodor F. Dragan
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57899-4_56
Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Absolute reflexive retracts and absolute bipartite retracts
- On rigid circuit graphs
- Graphs whose neighborhoods have no special cycles
- Clique graphs and Helly graphs
- Characterizations of strongly chordal graphs
- A characterization of totally balanced hypergraphs
- Pseudo-modular graphs
- Hereditary modular graphs
- On hypergraph acyclicity and graph chordality
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Classes of bipartite graphs related to chordal graphs
- Hypergraphes arbores
- Absolute retracts of bipartite graphs
- A characterisation of rigid circuit graphs
- Incidence matrices and interval graphs
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Syntactic Characterization of Tree Database Schemas
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Characterizations of totally balanced matrices
- Totally-Balanced and Greedy Matrices
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Doubly Lexical Orderings of Matrices
- Three Partition Refinement Algorithms
- Polynomially bounded algorithms for locatingp-centers on a tree
- Algorithmic Aspects of Vertex Elimination on Graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Clique Graphs of Chordal and Path Graphs
- Doubly chordal graphs, steiner trees, and connected domination
This page was built for publication: Dually chordal graphs
