Convex \(p\)-partitions of bipartite graphs
From MaRDI portal
Publication:897926
DOI10.1016/j.tcs.2015.11.014zbMath1331.05178arXiv1501.01707MaRDI QIDQ897926
Martín D. Safe, Luciano N. Grippo, Martin Matamala, Maya Jakobine Stein
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01707
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Strong geodetic cores and Cartesian product graphs, On finding convex cuts in general, bipartite and plane graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the computation of the hull number of a graph
- Convexity in graphs
- On the convexity number of graphs
- On the hull number of some graph classes
- Partitioning a graph into convex sets
- Geodesic Convexity in Graphs
- Undirected single-source shortest paths with positive integer weights in linear time
- Convex Partitions of Graphs
- Finding All Convex Cuts of a Plane Graph in Cubic Time