scientific article; zbMATH DE number 6503350
From MaRDI portal
Publication:3450147
Recommendations
- Edge intersection graphs of linear 3-uniform hypergraphs
- Recognizing intersection graphs of linear uniform hypergraphs
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
- scientific article; zbMATH DE number 1512682
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- On Lagrangians of 3-uniform hypergraphs missing edges in a large clique
- On line graphs of linear 3-uniform hypergraphs
- On graphs in which the intersection of neighborhoods of vertices from every 3-coclique is a clique
- On the size of 3-uniform linear hypergraphs
- Structure and complexity of 2-intersection graphs of 3-hypergraphs
Cited in
(5)- On line graphs of linear 3-uniform hypergraphs
- The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs
- Edge intersection graphs of linear 3-uniform hypergraphs
- Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450147)
