Vertex-gluings of sensitive graphs

MaRDI QIDQ810049zbMATH OpenFDO

Authors K. S. Poh, K. M. Koh

Publication date 1991

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

disjoint graphssensitive graphsstrongly sensitive graphvertex-gluing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 4066955
• Constructions of sensitive graphs which are not strongly sensitive
• Clique partitions of glued graphs
• scientific article; zbMATH DE number 861330
• On a construction of critical graphs which are not sensitive

Cited in

(4)

• Products of graphs with their closed-set lattices
• On the lower length of the closed-set lattice of a tree
• scientific article; zbMATH DE number 4066955 (Why is no real title available?)
• scientific article; zbMATH DE number 861330 (Why is no real title available?)

This page was built for publication: Vertex-gluings of sensitive graphs

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