Characterizing Block Graphs in Terms of their Vertex-Induced Partitions
A. Dress, K. T. Huber, J. Koolen, V. Moulton, A. Spillner

TL;DR
This paper characterizes block graphs via vertex-induced partitions, showing how to uniquely determine the minimal block graph containing a given edge set and describing conditions for families of partitions to correspond to such graphs.
Contribution
It introduces a novel characterization of block graphs using vertex-induced partitions and provides criteria for when a family of partitions corresponds to a block graph.
Findings
The smallest block graph with a given edge set is uniquely determined by vertex-induced partitions.
The edge set of the block graph can be described by connected components in modified graphs.
Conditions are established for families of partitions to be realizable by a block graph.
Abstract
Given a finite connected simple graph with vertex set and edge set , we will show that the (necessarily unique) smallest block graph with vertex set whose edge set contains is uniquely determined by the -indexed family of the various partitions of the set into the set of connected components of the graph , the edge set of this block graph coincides with set of all -subsets of for which and are, for all , contained in the same connected component of , and an arbitrary -indexed family of partitions of the set is of the form for some connected simple graph with vertex set as above if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Finite Group Theory Research
