Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

100%

Metelsky Y., Schemeleva K., Werner F.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 1

13-28

We characterize the class [...] L32 $L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs. We also give an O(n)-time algorithm for the recognition of graphs from [...] L32 $L_3^2 $ in the class of threshold graphs, where n is the number of vertices of a tested graph.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Metelsky Y.

1 Schemeleva K.

1 Werner F.

1 2017

Wyniki wyszukiwania

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