On line graphs of linear 3-uniform hypergraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-K" /><243::AID-JGT1>3.0.CO;2-K 10.1002/(SICI)1097-0118(199708)25:4<243::AID-JGT1>3.0.CO;2-KzbMath0881.05111OpenAlexW4255219245WikidataQ56874771 ScholiaQ56874771MaRDI QIDQ4351311

No author found.

Publication date: 16 February 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199708)25:4<243::aid-jgt1>3.0.co;2-k

zbMATH Keywords

hypergraphintersection graphline graphforbidden induced subgraphsrecognition problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Related Items (5)

Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ 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 ⋮ Edge intersection graphs of linear 3-uniform hypergraphs ⋮ Edge intersection graphs of linear 3-uniform hypergraphs ⋮ On the problem of domino recognition

This page was built for publication: On line graphs of linear 3-uniform hypergraphs