Line Graphs of Helly Hypergraphs
From MaRDI portal
Publication:4443100
DOI10.1137/S089548019936521XzbMath1029.05107MaRDI QIDQ4443100
Yury Metelsky, Regina I. Tyshkevich
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
graph; hypergraph; clique; induced subgraph; \(r\)-covering; Helly hypergraph; finite characterization; line graph of hypergraph; \(r\)-mino; rank of hypergraph
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Rainbow independent sets in certain classes of graphs, On bounding the difference of the maximum degree and the clique number, Complexity aspects of generalized Helly hypergraphs, 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, Characterization of classical graph classes by weighted clique graphs, Polynomial Kernelization for Removing Induced Claws and Diamonds
