Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
Samuel German
A vertex-coloring of a connected graph is a strong conflict-free vertex-connection coloring if every two distinct vertices are joined by a shortest path on which some color app…
cs.DM2026
The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction
Samuel German
For an -vertex graph , let denote the number of zero forcing sets of size . A conjecture of Boyer et al. asserts that the path maximizes these numbers coeff…