\BOOKMARK [0][]{chapter.1}{Adjacency stable connected operators and set levelings}{}
\BOOKMARK [1][-]{section.1.1}{Introduction}{chapter.1}
\BOOKMARK [1][-]{section.1.2}{Background}{chapter.1}
\BOOKMARK [2][-]{subsection.1.2.1}{General definitions}{section.1.2}
\BOOKMARK [2][-]{subsection.1.2.2}{Some background on connectivity and connected operators}{section.1.2}
\BOOKMARK [2][-]{subsection.1.2.3}{Connectivity requirement}{section.1.2}
\BOOKMARK [1][-]{section.1.3}{Adjacency stability}{chapter.1}
\BOOKMARK [1][-]{section.1.4}{Levelings and set levelings}{chapter.1}
\BOOKMARK [1][-]{section.1.5}{Relationships between adjacency stable connected operators and set levelings}{chapter.1}
\BOOKMARK [2][-]{subsection.1.5.1}{Adjacency stable connected operators: input/output variations restriction}{section.1.5}
\BOOKMARK [2][-]{subsection.1.5.2}{Set levelings: input/output variation restriction}{section.1.5}
\BOOKMARK [2][-]{subsection.1.5.3}{Discussion}{section.1.5}
\BOOKMARK [1][-]{section.1.6}{On commutative properties of open-close and close-open filters for connected operators}{chapter.1}
\BOOKMARK [2][-]{subsection.1.6.1}{Marker-based operators}{section.1.6}
\BOOKMARK [2][-]{subsection.1.6.2}{A commutative property}{section.1.6}
\BOOKMARK [1][-]{section.1.7}{Conclusion}{chapter.1}