Graphs with a minimal number of convex sets

DOI10.1007/S00373-013-1356-2zbMATH Open1306.05041OpenAlexW2085702149MaRDI QIDQ489304FDOQ489304

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

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

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)

Cites Work

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

Cited In (9)

• Title not available (Why is that?)
• Generating and enumerating digitally convex sets of trees
• Drawability of Complete Graphs Using a Minimal Slope Set
• Convex sets in graphs. II: Minimal path convexity
• Minimal path convexity under some graph operations
• Efficient realizations of closure systems
• Minconvex Factors of Prescribed Size in Graphs
• On the spectrum and number of convex sets in graphs
• Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent

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)