Constructions of sensitive graphs which are not strongly sensitive

DOI10.1016/0012-365X(88)90212-9MaRDI QIDQ1813202zbMATH OpenOpenAlexFDO

Authors K. S. Poh, K. M. 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

closed setcriticalsensitivestrongly sensitiveclosed-set lattice

Mathematics Subject Classification ID

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

Recommendations

• On an isomorphism problem on the closed-set lattice of a graph
• On a construction of critical graphs which are not sensitive
• Products of graphs with their closed-set lattices
• scientific article; zbMATH DE number 4066955
• scientific article; zbMATH DE number 861330

Cites work

• scientific article; zbMATH DE number 3875318 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• On a construction of critical graphs which are not sensitive
• On an isomorphism problem on the closed-set lattice of a graph
• On the uniformity of the closed-set lattice of a tree

Cited in

(4)

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

This page was built for publication: Constructions of sensitive graphs which are not strongly sensitive

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