On hypergraph acyclicity and graph chordality
From MaRDI portal
Publication:1114449
DOI10.1016/0020-0190(88)90121-4zbMath0662.68111OpenAlexW2016035215MaRDI QIDQ1114449
Alessandro D'Atri, Marina Moscarini
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90121-4
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)
Related Items (13)
The parallel solution of domination problems on chordal and strongly chordal graphs ⋮ Incidence graphs of biacyclic hypergraphs ⋮ Equivalence between hypergraph convexities ⋮ Dually chordal graphs ⋮ CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT ⋮ On some partial line graphs of a hypergraph and the associated matroid ⋮ On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs ⋮ On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay ⋮ A fast algorithm for query optimization in universal-relation databases ⋮ Laminar structure of ptolemaic graphs with applications ⋮ Canonical and monophonic convexities in hypergraphs ⋮ Clique graphs and Helly graphs ⋮ On the Galois lattice of bipartite distance hereditary graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Hypergraphs with no special cycles
- Connections in acyclic hypergraphs
- Characterizations of strongly chordal graphs
- Hypergraphs without a large star
- A characterization of totally balanced hypergraphs
- Distance-hereditary graphs
- Testing the universal instance assumption
- On metric properties of certain clique graphs
- Parallel concepts in graph theory
- 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
- Steiner trees, connected domination and strongly chordal graphs
- A characterization of ptolemaic graphs
- Tree queries
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Characterization of Certain Ptolemaic Graphs
This page was built for publication: On hypergraph acyclicity and graph chordality
