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
DOI10.7151/dmgt.1916zbMath1354.05094DBLPjournals/dmgt/MetelskyS017OpenAlexW2501868479WikidataQ57633766 ScholiaQ57633766MaRDI QIDQ505460
Frank Werner, Yury Metelsky, Kseniya Schemeleva
Publication date: 23 January 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1916
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden configurations in intersection graphs of r-graphs
- Complexity of representation of graphs by set systems
- Intersection graphs of k-uniform linear hypergraphs
- Recognizing intersection graphs of linear uniform hypergraphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Graphe représentatif des aretes d'un multigraphe
- An efficient reconstruction of a graph from its line graph in parallel
- Intersection Graphs of k-Uniform Hypergraphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Split Graphs Having Dilworth Number Two
- On line graphs of linear 3-uniform hypergraphs
- Krausz dimension and its generalizations in special graph classes
- Edge intersection graphs of linear 3-uniform hypergraphs
This page was built for publication: 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
