On a construction of critical graphs which are not sensitive

DOI10.1007/BF02582951zbMath0575.05048OpenAlexW2001833256MaRDI QIDQ1064327

K. S. Poh, Khee Meng Koh

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02582951

zbMATH Keywords

critical graphclosed-set lattice of a graphsensitive graph

Mathematics Subject Classification ID

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

Related Items (4)

On the uniformity of the closed-set lattice of a tree ⋮ On the lower length of the closed-set lattice of a tree ⋮ Products of graphs with their closed-set lattices ⋮ Constructions of sensitive graphs which are not strongly sensitive

Cites Work

• On an isomorphism problem on the closed-set lattice of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: On a construction of critical graphs which are not sensitive