Year: 2025
Type: preprint
Abstract: A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B]) < ω(H)$. A graph $G$ is perfectly weight divisible if for every positive integral weight function on $V(G)$ and each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and the maximum weight of a clique in $H[B]$ is smaller than the maximum weight of a clique in $H$. In this paper, we prove that the perfect divisibility of a graph is equivalent to its perfect weighted divisibility.
Source: arXiv (Cornell University)
Authors: Hu, Qiming, Xu, Baogang, Zhuang, Miaoxia
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6910745379
Cites:
Cited by:
Related to: