Graphs with a minimal number of convex sets

DOI10.1007/S00373-013-1356-2MaRDI QIDQ489304zbMATH OpenOpenAlexFDO

Authors 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 setsgenerating polynomialroot\(g\)-minimal graphs\(m\)-minimal graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2188451
• A lower bound for the convexity number of some graphs
• \(H\)-convex graphs
• Convex sets in graphs. II: Minimal path convexity
• Minimal path convexity under some graph operations

Cites work

• scientific article; zbMATH DE number 437485 (Why is no real title available?)
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3865341 (Why is no real title available?)
• scientific article; zbMATH DE number 3880762 (Why is no real title available?)
• scientific article; zbMATH DE number 3749035 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• Bounding the roots of ideal and open set polynomials
• Bounding the roots of independence polynomials.
• Complexity results related to monophonic convexity
• Convexity and HHD-Free Graphs
• Convexity in Graphs and Hypergraphs
• Dependence polynomials
• Minimal trees and monophonic convexity
• On chromatic roots of large subdivisions of graphs
• On graphs with a unique minimum hull set
• On the Steiner, geodetic and hull numbers of graphs
• On the chromatic roots of generalized theta graphs
• On the computation of the hull number of a graph
• On the convexity number of graphs
• On the hull number of a graph.
• On the hull number of triangle-free graphs
• On the location of roots of independence polynomials
• On the log concavity of reliability and matroidal sequences
• Steiner trees and convex geometries
• The convexity number of a graph
• The hull number of a graph
• The roots of the independence polynomial of a clawfree graph
• Theory of monomer-dimer systems
• Zeros of Reliability Polynomials and f-vectors of Matroids

Cited in

(10)

• Convex sets in graphs. II: Minimal path convexity
• On the spectrum and number of convex sets in graphs
• scientific article; zbMATH DE number 5139432 (Why is no real title available?)
• Planar lattice subsets with minimal vertex boundary
• Efficient realizations of closure systems
• Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
• Drawability of Complete Graphs Using a Minimal Slope Set
• Minimal path convexity under some graph operations
• Generating and enumerating digitally convex sets of trees
• Minconvex Factors of Prescribed Size in Graphs

This page was built for publication: Graphs with a minimal number of convex sets

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