The strong intersecting number of a graph

MaRDI QIDQ2721703zbMATH OpenFDO

Authors Liangui Weng, Yueling Gu, Tianxing Yao

Publication date 6 June 2002

Published in Journal of Nanjing University. Mathematical Biquarterly (Search for Journal in Brave)

zbMATH Keywords

line graphsimple hypergraphstrong intersecting number

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Recognizing intersection graphs of linear uniform hypergraphs
• On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs
• A note on G-intersecting families
• On line graphs of linear 3-uniform hypergraphs
• Line hypergraphs

Cited in

(2)

• Strongly regular graphs and designs with three intersection numbers
• Strongly intersecting integer partitions

This page was built for publication: The strong intersecting number of a graph

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