Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
DOI10.1142/S1793830912500632zbMATH Open1257.05106OpenAlexW2036136115MaRDI QIDQ4903647FDOQ4903647
Authors: Mauro Mezzini, Marina Moscarini, Francesco M. Malvestuto 
Publication date: 24 January 2013
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830912500632
Recommendations
- On local convexity in graphs
- Two classes of graphs in which some problems related to convexity are efficiently solvable
- Graphs with a minimal number of convex sets
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- scientific article; zbMATH DE number 3786820
geodesic convexitymonophonic convexityPtolemaic graphsminimal vertex separators\(\gamma\)-acyclic hypergraphs
Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)
Cites Work
- Decomposition by clique separators
- Convexity in Graphs and Hypergraphs
- On the computation of the hull number of a graph
- Bridged graphs and geodesic convexity
- Convex sets in graphs. II: Minimal path convexity
- Treewidth. Computations and approximations
- Optimal decomposition by clique separators
- On the Desirability of Acyclic Database Schemes
- A characterization of ptolemaic graphs
- The geodetic number of a graph
- The All-Paths Transit Function of a Graph
- Degrees of acyclicity for hypergraphs and relational database schemes
- Canonical and monophonic convexities in hypergraphs
- On hypergraph acyclicity and graph chordality
- Computing simple-path convex hulls in hypergraphs
- Equivalence between hypergraph convexities
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Minimal vertex separators of chordal graphs
Cited In (8)
- On the geodeticity of the contour of a graph
- On local convexity in graphs
- A necessary condition for the equality of the clique number and the convexity number of a graph
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- Monophonic convexity in weighted graphs
- Two classes of graphs in which some problems related to convexity are efficiently solvable
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- On gated sets in graphs
This page was built for publication: Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903647)
