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

DOI10.1002/(SICI)1097-0118(199603)21:3%3C267::AID-JGT2%3E3.0.CO;2-OMaRDI QIDQ4875681zbMATH OpenOpenAlexFDO

Authors Leizhen Cai, Andrzej Proskurowski, Derek G. Corneil

Publication date 13 August 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199603)21:3%3C267::aid-jgt2%3E3.0.co;2-o

zbMATH Keywords

intersection graphscharacterizationhypergraphline graphsmultigraphsposetforbidden induced subgraphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 32301
• Intersection graphs of halflines and halfplanes
• scientific article; zbMATH DE number 870959
• scientific article; zbMATH DE number 125465
• On the structure of certain intersection graphs
• scientific article; zbMATH DE number 3878977
• A common generalization of line graphs and clique graphs
• Intersections of graphs
• scientific article; zbMATH DE number 38312
• Intersection graphs of general linear groups

Cited in

(5)

• Spanners in graphs of bounded degree
• Matroid representation of clique complexes
• The mincut graph of a graph
• 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

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