Graphs whose all maximal induced forests are of the same order
From MaRDI portal
Abstract: In this paper, a new concept in graphs namely well-f-coveredness is introduced. We characterize all graphs with such property, whose maximum induced forests are of boundary order. Also we prove several propositions concerning with obtaining large well-f-covered graphs from smaller ones. By the way, some interesting classes of well-f-covered graphs are characterized.
This page was built for publication: Graphs whose all maximal induced forests are of the same order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6368883)
