linear rank-width

tags: linear variant

functionally equivalent to: linear clique-width, linear NLC-width


Relations

OtherRelation fromRelation to
acyclic chromatic numberblueexclusionexclusion
admissibilityblueexclusionexclusion
arboricityblueexclusionexclusion
average degreeblueexclusionexclusion
average distanceblueexclusionexclusion
bandwidthgreenupper boundexclusion
bipartiteblueunboundedexclusion
bipartite numberblueexclusionexclusion
bisection bandwidthblueexclusionexclusion
blockcyanunknown to HOPSexclusion
book thicknessblueexclusionexclusion
boolean widthorangeunknown to HOPSupper bound
bounded componentsgreenupper boundexclusion
bounded expansionblueexclusionavoids
boxicityblueexclusionexclusion
branch widthcyanunknown to HOPSexclusion
c-closureblueexclusionexclusion
carving-widthcyanunknown to HOPSexclusion
chi-boundedredexclusionupper bound
chordalcyanunknown to HOPSexclusion
chordalitymagentaexclusionunknown to HOPS
chromatic numberblueexclusionexclusion
clique cover numberblueexclusionexclusion
clique-tree-widthorangeunknown to HOPSupper bound
clique-widthorangeunknown to HOPSupper bound
clustergreenupper boundexclusion
co-clustergreenupper boundexclusion
cographcyanunknown to HOPSexclusion
completegreenupper boundexclusion
connectedblueexclusionavoids
contraction complexitycyanunknown to HOPSexclusion
cutwidthgreenupper boundexclusion
cyclegreenupper boundexclusion
cyclesgreenupper boundexclusion
d-admissibilitymagentaexclusionunknown to HOPS
d-path-freegreenupper boundexclusion
degeneracyblueexclusionexclusion
degree treewidthcyanunknown to HOPSexclusion
diameterblueexclusionexclusion
diameter+max degreegreenupper boundexclusion
distance to bipartiteblueexclusionexclusion
distance to blockcyanunknown to HOPSexclusion
distance to bounded componentsgreenupper boundexclusion
distance to chordalblueexclusionexclusion
distance to clustergreenupper boundexclusion
distance to co-clustergreenupper boundexclusion
distance to cographcyanunknown to HOPSexclusion
distance to completegreenupper boundexclusion
distance to edgelessgreenupper boundexclusion
distance to forestcyanunknown to HOPSexclusion
distance to intervalblueexclusionexclusion
distance to linear forestgreenupper boundexclusion
distance to maximum degreeblueexclusionexclusion
distance to outerplanarcyanunknown to HOPSexclusion
distance to perfectblueexclusionexclusion
distance to planarblueexclusionexclusion
distance to starsgreenupper boundexclusion
domatic numberblueexclusionexclusion
domination numberblueexclusionexclusion
domino treewidthcyanunknown to HOPSexclusion
edge clique cover numbergreenupper boundexclusion
edge connectivityblueexclusionexclusion
edge-cut widthcyanunknown to HOPSexclusion
edge-treewidthcyanunknown to HOPSexclusion
edgelessgreenupper boundavoids
excluded minorblueexclusionavoids
excluded planar minorcyanunknown to HOPSavoids
excluded top-minorblueexclusionavoids
feedback edge setcyanunknown to HOPSexclusion
feedback vertex setcyanunknown to HOPSexclusion
flip-widthredexclusionupper bound
forestcyanunknown to HOPSexclusion
genusblueexclusionexclusion
gridblueunboundedexclusion
h-indexblueexclusionexclusion
intervalcyanunknown to HOPSexclusion
iterated type partitionscyanunknown to HOPSexclusion
linear clique-widthyellowupper boundupper bound
linear forestgreenupper boundexclusion
linear NLC-widthyellowupper boundupper bound
linear rank-widthyellowequalequal
maximum cliqueblueexclusionexclusion
maximum degreeblueexclusionexclusion
maximum independent setblueexclusionexclusion
maximum induced matchingblueexclusionexclusion
maximum leaf numbergreenupper boundexclusion
maximum matchinggreenupper boundexclusion
maximum matching on bipartite graphsgreenupper boundexclusion
merge-widthredexclusionupper bound
mim-widthorangeunknown to HOPSupper bound
minimum degreeblueexclusionexclusion
mm-widthcyanunknown to HOPSexclusion
modular-widthcyanunknown to HOPSexclusion
module-widthorangeunknown to HOPSupper bound
monadically dependentredexclusionupper bound
monadically stablemagentaexclusionunknown to HOPS
neighborhood diversitygreenupper boundexclusion
NLC-widthorangeunknown to HOPSupper bound
NLCT-widthorangeunknown to HOPSupper bound
nowhere densemagentaexclusionunknown to HOPS
odd cycle transversalblueexclusionexclusion
outerplanarcyanunknown to HOPSexclusion
overlap treewidthcyanunknown to HOPSexclusion
pathgreenupper boundexclusion
pathwidthgreenupper boundexclusion
pathwidth+maxdegreegreenupper boundexclusion
perfectblueunboundedexclusion
planarblueunboundedexclusion
radius-inf flip-widthorangeunknown to HOPSupper bound
radius-r flip-widthredexclusionupper bound
rank-widthorangeunknown to HOPSupper bound
series-parallelgrayunknown to HOPSunknown to HOPS
shrub-depthlimeupper boundunknown to HOPS
sim-widthredexclusionupper bound
sizegreenupper boundexclusion
slim tree-cut widthcyanunknown to HOPSexclusion
sparse twin-widthblueexclusionexclusion
stargreenupper boundexclusion
starsgreenupper boundexclusion
strong coloring numberblueexclusionexclusion
strong d-coloring numbermagentaexclusionunknown to HOPS
strong inf-coloring numbercyanunknown to HOPSexclusion
topological bandwidthgreenupper boundexclusion
treecyanunknown to HOPSexclusion
tree-cut widthcyanunknown to HOPSexclusion
tree-independence numbermagentaexclusionunknown to HOPS
tree-partition-widthcyanunknown to HOPSexclusion
treebandwidthcyanunknown to HOPSexclusion
treedepthgreenupper boundexclusion
treelengthmagentaexclusionunknown to HOPS
treespancyanunknown to HOPSexclusion
treewidthcyanunknown to HOPSexclusion
twin-cover numbergreenupper boundexclusion
twin-widthredexclusionupper bound
vertex connectivitygrayunknown to HOPSunknown to HOPS
vertex covergreenupper boundexclusion
vertex integritygreenupper boundexclusion
weak coloring numberblueexclusionexclusion
weak d-coloring numbermagentaexclusionunknown to HOPS
weak inf-coloring numbergreenupper boundexclusion
weakly sparsemagentaexclusionunknown to HOPS
weakly sparse and merge widthblueexclusionexclusion

Results