Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.23965

Two characterizations of chain partitioned probe graphs

Van Bang Le
View original source ↗Read source document ↗Export metadata ↓

Abstract

Chain graphs are exactly bipartite graphs without induced $2K_2$ (a graph with four vertices and two disjoint edges). A graph $G=(V,E)$ with a given independent set $S\subseteq V$ (a set of pairwise non-adjacent vertices) is said to be a chain partitioned probe graph if $G$ can be extended to a chain graph by adding edges between certain vertices in $S$. %there exists a set $E'\subseteq\binom{S}{2}$ such that the graph $G'=(V,E\cup E')$ is a chain graph. In this note we give two characterizations for chain partitioned probe graphs. The first one describes chain partitioned probe graphs by six forbidden subgraphs. The second one characterizes these graphs via a certain ``enhanced graph'': $G$ is a chain partitioned probe graph if and only if the enhanced graph $G^*$ is a chain graph. This is analogous to a result on interval (respectively, chordal, threshold, trivially perfect) partitioned probe graphs, and gives an $O(m^2)$-time recognition algorithm for chain partitioned probe graphs.

Explore related subjects

cs.DMmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Van Bang Le. 2026-10-11. Two characterizations of chain partitioned probe graphs. https://doi.org/10.1007/s10479-010-0749-3

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Counting and Sampling Manufacturable Stacking Sequences

Designing the stacking sequence of a composite laminate is a discrete optimisation problem: each ply takes one of a few orientations, each evaluation may cost a finite-element solve, and the design must obey manufacturing rules and design guidelines, which optimisers enforce by penalty, repair or rejection. We describe the admissible set exactly. The two manufacturing rules forbid a finite set of factors, so the sequences they admit form a regular language, recognised by an automaton that tracks the last orientation and the length of its run; balance and the ten per cent rule constrain the Parikh vector and are carried by a dynamic program over automaton state and counters. One table, polynomial in N, counts the admissible sequences without producing them, draws them uniformly, and tells whether a partial sequence can still be completed. We give pseudocode, exact counts for three orientation sets, closed-form ceilings on the composition, and four of the five single-rule entries a published table left uncomputed. At 48 plies, 99.8% of the nodes of a layer-wise search tree checking the rules locally have no admissible completion on eight orientations; the completion test removes them. A one-point crossover that cuts two admissible parents only where they share an automaton state and their child closes the counters returns admissible children by construction.

cs.DM↗
arXiv2026

The Strong Total Cover Problem

The Strong Total Cover Problem (STCP) is a novel covering problem defined on a graph $G = (V, E)$, where the objective is to find a minimum-cardinality subset $T \subseteq V \cup E$ such that every element of $V \cup E$ is covered. In this setting, a vertex covers itself and all its incident edges, while an edge covers itself together with its two endpoints. The STCP resembles classical covering problems such as Vertex Cover and Edge Cover problems, and naturally arises as the dual of the total matching problem. In this paper, we investigate the STCP from algorithmic, complexity, and polyhedral perspectives. We first establish close connections between STCP, the Dominating Set Problem, and the Maximum Induced Matching Problem. These relationships provide structural insights, imply the NP-hardness of STCP, and identify graph classes for which the problem is polynomial-time solvable. We then investigate the weighted version of STCP, showing that it remains NP-hard even on complete graphs with binary weights. On the other hand, we present a 2-approximation algorithm, and a polynomial-time algorithm for complete bipartite graphs. On the polyhedral side, we introduce the Strong Total Cover Polytope and derive several families of valid inequalities, some of which are shown to define facets. Finally, we provide a complete linear description of the associated polytope for triangular cactus graphs, revealing an interesting contrast with the considerably more intricate facial structure of the dominating set polytope on cactus graphs.

cs.DM↗
arXiv2026

From Border-Agnosticism to Causal Rewrite Systems

Causal Graph Rewriting was recently introduced as an evolution of Causal Graph Dynamics to allow for a controlled form of asynchronism in these dynamical systems with dynamical graphs. In this context, the notion of borders---akin to dangling edges---has gained increasing importance. In this paper, we re-examine these borders, interpreting them as missing information. This perspective adds structural rigor to the framework, allowing border-agnostic causal graph rewriting to be reformulated as a rewriting system rather than a dynamical system. This shift represents a crucial step toward facilitating the treatment of reversibility.

cs.DM↗