Partitioning a graph into convex sets

DOI10.1016/j.disc.2011.05.023zbMath1223.05220OpenAlexW2124563183MaRDI QIDQ2275456

Mitre C. Dourado, Simone Dantas, D. Artigas, Jayme Luiz Szwarcfiter

Publication date: 9 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.023

zbMATH Keywords

convexitychordal graphscographspowers of cyclesconvex partition

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (13)

The geodesic classification problem on graphs ⋮ Geodeticity of the contour of chordal bipartite graphs ⋮ On finding convex cuts in general, bipartite and plane graphs ⋮ Unnamed Item ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Convex \(p\)-partitions of bipartite graphs ⋮ Efficient realizations of closure systems ⋮ On the contour of graphs ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ On the contour of bipartite graphs ⋮ Strong geodetic cores and Cartesian product graphs ⋮ Covering graphs with convex sets and partitioning graphs into convex sets ⋮ On the spectrum and number of convex sets in graphs

Cites Work

• Unnamed Item
• Some remarks on Hajós' conjecture
• On geodetic sets formed by boundary vertices
• A result on the total colouring of powers of cycles
• Some remarks on the geodetic number of a graph
• Complexity results related to monophonic convexity
• On the computation of the hull number of a graph
• The theory of convex geometries
• On local convexity in graphs
• Complement reducible graphs
• Convexity in graphs
• On triangle path convexity in graphs
• Separation of two convex sets in convexity structures
• LexBFS-orderings and powers of chordal graphs
• Some remarks on simple tournaments
• Convex Partitions of Graphs
• Conditions for invariance of set diameters under d-convexification in a graph
• A Linear Recognition Algorithm for Cographs
• Convexity in Graphs and Hypergraphs
• Stability in circular arc graphs
• Colouring clique-hypergraphs of circulant graphs

This page was built for publication: Partitioning a graph into convex sets