Browsing Araştırma Çıktıları | WoS | Scopus | TR-Dizin | PubMed by Subject "Graph minors"
Now showing items 1-3 of 3
-
Block Elimination Distance
(Springer Japan Kk, 2022)We introduce the parameter of block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class g, the class B(G) contains all graphs whose blocks belong to G and ... -
Block Elimination Distance
(Springer Science and Business Media Deutschland GmbH, 2021)We introduce the parameter of block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class G, the class B(G) contains all graphs whose blocks belong to G and ... -
Four-searchable biconnected outerplanar graphs
(Elsevier, 2022)This paper deals with constructing obstruction sets for two subclasses of 4-searchable graphs. We first characterize the 4-searchable biconnected outerplanar graphs by listing all graphs that cannot be their minors; we ...