Characterization of α-excellent 2-trees
Abstract
A graph is α-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the α-excellent 2-trees.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.