@Article{Cichacz2010,
author = "Cichacz, Sylwia",
title = "2-splittable and cordial graphs",
journal = "Opuscula Math.",
year = "2010",
volume = "30",
number = "1",
pages = "61--67",
doi = "http://dx.doi.org/10.7494/OpMath.2010.30.1.61",
url = "http://dx.doi.org/10.7494/OpMath.2010.30.1.61",
abstract = "E. Miller and G. E. Stevens proved in [E. Miller, G. E. Stevens, Some graphs for which even size is sufficient for splittability, 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.",
keywords = "cordial graphs, \(2\)-splittable graphs",
issn = "1232-9274"
}