Reduced component max-leaf is a new graph parameter strictly between clique-width and reduced bandwidth that unifies tractability results and implies bounded treewidth under bounded degree in sparse classes.
Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings.Theory Comput
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Moderately beyond clique-width: reduced component max-leaf and related parameters
Reduced component max-leaf is a new graph parameter strictly between clique-width and reduced bandwidth that unifies tractability results and implies bounded treewidth under bounded degree in sparse classes.