Graphs with a minimal number of convex sets

DOI10.1007/s00373-013-1356-2zbMath1306.05041OpenAlexW2085702149MaRDI QIDQ489304

Ortrud R. Oellermann, Jason I. Brown

Publication date: 20 January 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1356-2

zbMATH Keywords

convex setsrootgenerating polynomial\(g\)-minimal graphs\(m\)-minimal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items

Generating and enumerating digitally convex sets of trees, Efficient realizations of closure systems, On the spectrum and number of convex sets in graphs

Cites Work

• On the location of roots of independence polynomials
• The roots of the independence polynomial of a clawfree graph
• Complexity results related to monophonic convexity
• On the computation of the hull number of a graph
• The hull number of a graph
• On the log concavity of reliability and matroidal sequences
• The convexity number of a graph
• On the Steiner, geodetic and hull numbers of graphs
• On the chromatic roots of generalized theta graphs
• On the convexity number of graphs
• Theory of monomer-dimer systems
• Bounding the roots of ideal and open set polynomials
• Dependence polynomials
• On graphs with a unique minimum hull set
• Minimal trees and monophonic convexity
• On the Hull Number of Triangle-Free Graphs
• Steiner Trees and Convex Geometries
• Convexity in Graphs and Hypergraphs
• Convexity and HHD-Free Graphs
• Zeros of Reliability Polynomials and f-vectors of Matroids
• On chromatic roots of large subdivisions of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item