Abstract
Erlebach et al. define the notion of a trimmable class of graphs. This was motivated by a problem in map labelling. Roughly speaking, a class C of graphs is trimmable if, for each graph G∈C, it is possible to remove a small proportion of the vertices of G to obtain a graph with no long simple paths. More generally, one considers vertex-weighted graphs and tries to remove a set of vertices of small weight. Erlebach et al. prove that any class of weighted graphs of bounded treewidth and bounded degree is trimmable. They ask whether this remains true if the degree is not required to be bounded. In this paper a positive answer is given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
