On some partial line graphs of a hypergraph and the associated matroid
From MaRDI portal
Publication:686485
DOI10.1016/0012-365X(93)90168-SzbMATH Open0782.05060MaRDI QIDQ686485FDOQ686485
Authors: Philippe Jégou, Marie-Catherine Vilarem
Publication date: 5 January 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- A Sufficient Condition for Backtrack-Free Search
- Network-based heuristics for constraint-satisfaction problems
- On the Desirability of Acyclic Database Schemes
- Networks of constraints: Fundamental properties and applications to picture processing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Power of Natural Semijoins
- Degrees of acyclicity for hypergraphs and relational database schemes
- On hypergraph acyclicity and graph chordality
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
Cited In (2)
This page was built for publication: On some partial line graphs of a hypergraph and the associated matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686485)