On some partial line graphs of a hypergraph and the associated matroid
From MaRDI portal
Publication:686485
DOI10.1016/0012-365X(93)90168-SzbMath0782.05060MaRDI QIDQ686485
Philippe Jégou, Marie-Catherine Vilarem
Publication date: 5 January 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Network-based heuristics for constraint-satisfaction problems
- On hypergraph acyclicity and graph chordality
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
- Networks of constraints: Fundamental properties and applications to picture processing
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Power of Natural Semijoins
- A Sufficient Condition for Backtrack-Free Search
This page was built for publication: On some partial line graphs of a hypergraph and the associated matroid