Lower Bounds for Protrusion Replacement by Counting Equivalence Classes
From MaRDI portal
Publication:4634400
DOI10.4230/LIPIcs.IPEC.2016.17zbMath1398.05110arXiv1609.09304OpenAlexW3023260715MaRDI QIDQ4634400
Bart M. P. Jansen, Jules Wulms
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1609.09304
Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
This page was built for publication: Lower Bounds for Protrusion Replacement by Counting Equivalence Classes