Smaller kernels for 3-leaf power modifications problems

A graph G is a 3-leaf power if there is a tree T and a bijective mapping f from V(G) to the set of leaves of T such that (u,v)∈E(G) if and only if the distance in T between f(u) and f(v) is at most 3 for every distinct u,v∈V(G). In the 3-Leaf Power Vertex Deletion (resp., 3-Leaf Power Completion) pr...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1055; p. 115483
Main Author:	Tsur, Dekel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 09.11.2025
Subjects:	Graph algorithms Kernelization Parameterized complexity Parameterized complexity Graph algorithms Kernelization
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!