Convex Partitions of Graphs
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- Convexity and HHD-Free Graphs
- Convexity in Graphs and Hypergraphs
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- On the computation of the hull number of a graph
- Rebuilding convex sets in graphs
- Some remarks on the convexity number of a graph
- The convexity number of a graph
- The theory of convex geometries
Cited in
(14)- A convexity lemma and expansion procedures for bipartite graphs
- Interior vertices in set partitions
- Perfect partitions of convex sets in the plane
- On the convexity number of graphs
- Partitioning a graph into convex sets
- On finding convex cuts in general, bipartite and plane graphs
- Fully gated graphs: Recognition and convex operations
- On k-convex polygons
- scientific article; zbMATH DE number 1539530 (Why is no real title available?)
- Finding all convex cuts of a plane graph in cubic time
- Co-2-plex vertex partitions
- scientific article; zbMATH DE number 2204179 (Why is no real title available?)
- Convex partitions of graphs induced by paths of order three
- Convex \(p\)-partitions of bipartite graphs
This page was built for publication: Convex Partitions of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503464)