Constructions of sensitive graphs which are not strongly sensitive

DOI10.1016/0012-365X(88)90212-9zbMath0747.05049OpenAlexW2070414071MaRDI QIDQ1813202

K. S. Poh, Khee Meng Koh

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90212-9

zbMATH Keywords

criticalclosed setsensitivestrongly sensitiveclosed-set lattice

Mathematics Subject Classification ID

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

Related Items

On the lower length of the closed-set lattice of a tree, Products of graphs with their closed-set lattices

Cites Work

• On an isomorphism problem on the closed-set lattice of a graph
• On a construction of critical graphs which are not sensitive
• On the uniformity of the closed-set lattice of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item