NLC-width

functionally equivalent to: boolean width, rank-width, clique-width, module-width, radius-inf flip-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 widthyellowupper boundupper bound
bounded componentsgreenupper boundexclusion
bounded expansionblueexclusionavoids
boxicityblueexclusionexclusion
branch widthgreenupper boundexclusion
c-closureblueexclusionexclusion
carving-widthgreenupper boundexclusion
chi-boundedredexclusionupper bound
chordalcyanunknown to HOPSexclusion
chordalityblueexclusionexclusion
chromatic numberblueexclusionexclusion
clique cover numberblueexclusionexclusion
clique-tree-widthlimeupper boundunknown to HOPS
clique-widthyellowupper boundupper bound
clustergreenupper boundexclusion
co-clustergreenupper boundexclusion
cographgreenupper boundexclusion
completegreenupper boundexclusion
connectedblueexclusionavoids
contraction complexitygreenupper boundexclusion
cutwidthgreenupper boundexclusion
cyclegreenupper boundexclusion
cyclesgreenupper boundexclusion
d-admissibilitymagentaexclusionunknown to HOPS
d-path-freegreenupper boundexclusion
degeneracyblueexclusionexclusion
degree treewidthgreenupper boundexclusion
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 cographgreenupper boundexclusion
distance to completegreenupper boundexclusion
distance to edgelessgreenupper boundexclusion
distance to forestgreenupper boundexclusion
distance to intervalblueexclusionexclusion
distance to linear forestgreenupper boundexclusion
distance to maximum degreeblueexclusionexclusion
distance to outerplanargreenupper boundexclusion
distance to perfectblueexclusionexclusion
distance to planarblueexclusionexclusion
distance to starsgreenupper boundexclusion
domatic numberblueexclusionexclusion
domination numberblueexclusionexclusion
domino treewidthgreenupper boundexclusion
edge clique cover numbergreenupper boundexclusion
edge connectivityblueexclusionexclusion
edge-cut widthgreenupper boundexclusion
edge-treewidthgreenupper boundexclusion
edgelessgreenupper boundavoids
excluded minorblueexclusionavoids
excluded planar minorgreenupper boundavoids
excluded top-minorblueexclusionavoids
feedback edge setgreenupper boundexclusion
feedback vertex setgreenupper boundexclusion
flip-widthredexclusionupper bound
forestgreenupper boundexclusion
genusblueexclusionexclusion
gridblueunboundedexclusion
h-indexblueexclusionexclusion
intervalcyanunknown to HOPSexclusion
iterated type partitionsgreenupper boundexclusion
linear clique-widthlimeupper boundunknown to HOPS
linear forestgreenupper boundexclusion
linear NLC-widthlimeupper boundunknown to HOPS
linear rank-widthlimeupper boundunknown to HOPS
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-widthgreenupper boundexclusion
modular-widthgreenupper boundexclusion
module-widthyellowupper boundupper bound
monadically dependentredexclusionupper bound
monadically stablemagentaexclusionunknown to HOPS
neighborhood diversitygreenupper boundexclusion
NLC-widthyellowequalequal
NLCT-widthlimeupper boundunknown to HOPS
nowhere densemagentaexclusionunknown to HOPS
odd cycle transversalblueexclusionexclusion
outerplanargreenupper boundexclusion
overlap treewidthgreenupper boundexclusion
pathgreenupper boundexclusion
pathwidthgreenupper boundexclusion
pathwidth+maxdegreegreenupper boundexclusion
perfectblueunboundedexclusion
planarblueunboundedexclusion
radius-inf flip-widthyellowupper boundupper bound
radius-r flip-widthredexclusionupper bound
rank-widthyellowupper boundupper bound
series-parallelgrayunknown to HOPSunknown to HOPS
shrub-depthgreenupper boundexclusion
sim-widthredexclusionupper bound
sizegreenupper boundexclusion
slim tree-cut widthgreenupper boundexclusion
sparse twin-widthblueexclusionexclusion
stargreenupper boundexclusion
starsgreenupper boundexclusion
strong coloring numberblueexclusionexclusion
strong d-coloring numbermagentaexclusionunknown to HOPS
strong inf-coloring numbergreenupper boundexclusion
topological bandwidthgreenupper boundexclusion
treegreenupper boundexclusion
tree-cut widthgreenupper boundexclusion
tree-independence numbermagentaexclusionunknown to HOPS
tree-partition-widthgreenupper boundexclusion
treebandwidthgreenupper boundexclusion
treedepthgreenupper boundexclusion
treelengthmagentaexclusionunknown to HOPS
treespangreenupper boundexclusion
treewidthgreenupper boundexclusion
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