Geodesic treewidth and row treewidth are separated by non-implication, differing complexities (poly-time vs NP-hard for tw=2 case; XP vs none), one-way boundedness implication, overall NP-hardness for geodesic treewidth, and planar lower bound raised to 5.
Shorter labeling schemes for planar graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Introduces H-clique-width as a hereditary generalization of clique-width via induced subgraphs in strong products and reformulates planar product theorems under induced containment.
citing papers explorer
-
Separating Geodesic Structure and Product Structure
Geodesic treewidth and row treewidth are separated by non-implication, differing complexities (poly-time vs NP-hard for tw=2 case; XP vs none), one-way boundedness implication, overall NP-hardness for geodesic treewidth, and planar lower bound raised to 5.
-
Hereditary Graph Product Structure and $\cal H$-clique-width
Introduces H-clique-width as a hereditary generalization of clique-width via induced subgraphs in strong products and reformulates planar product theorems under induced containment.