Repository logo

Browsing by Subject "2-splittable graphs"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    2-splittable and cordial graphs
    (2010) Cichacz-Przeniosło, Sylwia
    E. Miller and G. E. Stevens proved in [E. Miller, G. E. Stevens, <i>Some graphs for which even size is sufficient for splittability</i>, Congressus Numerantium 173 (2005), 137–147] the existence of certain families of $2$-splittable caterpillars. In this paper we characterize other families of $2$-splittable caterpillars. Moreover, we show that for some of them there exists a friendly labeling inducing two isomorphic subgraphs.