The inverse problem for certain tree parameters


Let p be a graph parameter that assigns a positive integer value to every graph. The inverse problem for p asks for a graph within a prescribed class (here, we will only be concerned with trees), given the value of p. In this context, it is of interest to know whether such a graph can be found for all or at least almost all integer values of p. We will… (More)
DOI: 10.1016/j.dam.2009.07.004


3 Figures and Tables

Cite this paper

@article{Czabarka2009TheIP, title={The inverse problem for certain tree parameters}, author={{\'E}va Czabarka and L{\'a}szl{\'o} A. Sz{\'e}kely and Stephan G. Wagner}, journal={Discrete applied mathematics}, year={2009}, volume={157 15}, pages={3314-3319} }