Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs
Given a 3-uniform hypergraph H having a set V of vertices, and a set of hyperedges T ⊂ P(V), whose elements have cardinality three each, a null labelling is an assignment of ±1 to the hyperedges such that each vertex belongs to the same number of hyperedges labelled +1 and −1. A sufficient condition...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://depot.sorbonne.ae/handle/20.500.12458/1367 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|