Discrete Mathematics & Theoretical Computer Science17(2), 77–100 (2015)

Ganian, R · 2015 · DOI 10.46298/dmtcs.2136

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DM · 2026-05-13 · accept · novelty 7.0

Kernelization establishes FPT for strong CFVC number by twin cover plus k, with svcfc(G) bounded between χ(G) and χ(G) plus twin cover size.

Showing 1 of 1 citing paper.

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds cs.DM · 2026-05-13 · accept · none · ref 5
Kernelization establishes FPT for strong CFVC number by twin cover plus k, with svcfc(G) bounded between χ(G) and χ(G) plus twin cover size.