Line Graphs of Helly Hypergraphs
From MaRDI portal
Recommendations
Cited in
(18)- Line hypergraphs: A survey
- Excluding hooks and their complements
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Polynomial kernelization for removing induced claws and diamonds
- Lines in hypergraphs
- Characterization of classical graph classes by weighted clique graphs
- Polynomial kernelization for removing induced claws and diamonds
- Helly dimension of line graphs of k-uniform hypergraphs
- Graphs as r-minoes
- On bounding the difference of the maximum degree and the clique number
- Rainbow independent sets in certain classes of graphs
- Dominoes
- Fractal networks: topology, dimension, and complexity
- Computing subset vertex covers in H-free graphs
- A quadratic kernel for \{Claw, Diamond\}-free deletion
- A quadratic kernel for \{\textit{claw, diamond}\}-free deletion
- Complexity aspects of generalized Helly hypergraphs
This page was built for publication: Line Graphs of Helly Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443100)