A generalization of line graphs: (X, Y)-intersection graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199603)21:3<267::AID-JGT2>3.0.CO;2-O" /><267::AID-JGT2>3.0.CO;2-O 10.1002/(SICI)1097-0118(199603)21:3<267::AID-JGT2>3.0.CO;2-OzbMath0843.05087OpenAlexW4253838773MaRDI QIDQ4875681

Leizhen Cai, Andrzej Proskurowski, Derek Gordon Corneil

Publication date: 13 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199603)21:3<267::aid-jgt2>3.0.co;2-o

zbMATH Keywords

hypergraphposetcharacterizationmultigraphsforbidden induced subgraphsintersection graphsline graphs

Mathematics Subject Classification ID

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

Related Items (4)

Matroid representation of clique complexes ⋮ Spanners in graphs of bounded degree ⋮ Color-line and proper color-line graphs ⋮ Line graphs and forbidden induced subgraphs

This page was built for publication: A generalization of line graphs: (X, Y)-intersection graphs