On line graphs of linear 3-uniform hypergraphs

DOI10.1002/(SICI)1097-0118(199708)25:4%3C243::AID-JGT1%3E3.0.CO;2-KMaRDI QIDQ4351311zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 16 February 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199708)25:4%3C243::aid-jgt1%3E3.0.co;2-k

zbMATH Keywords

forbidden induced subgraphshypergraphintersection graphline graphrecognition problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2107052
• A solution to a problem of Jacobson, Kézdy and Lehel
• Edge intersection graphs of linear 3-uniform hypergraphs
• Line hypergraphs
• scientific article; zbMATH DE number 6503350

Cited in

(21)

• On automorphisms of line-graphs
• Recognizing intersection graphs of linear uniform hypergraphs
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
• The strong intersecting number of a graph
• On uniform linear hypergraph set-indexers of a graph
• On the problem of domino recognition
• scientific article; zbMATH DE number 6503350 (Why is no real title available?)
• Graphs as r-minoes
• On the size of 3-uniform linear hypergraphs
• scientific article; zbMATH DE number 123325 (Why is no real title available?)
• Line Graphs of Helly Hypergraphs
• scientific article; zbMATH DE number 6863845 (Why is no real title available?)
• scientific article; zbMATH DE number 2107052 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 7325727 (Why is no real title available?)
• Edge intersection graphs of linear 3-uniform hypergraphs
• Edge intersection graphs of linear 3-uniform hypergraphs
• On 3-uniform hypergraphs without linear cycles
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
• Correcting a graph into a linegraph minimizing Hamming distance edition is NP-complete and FPT by treewidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351311)