@inbook{2e6a41e147ef46138a9d58b7e0aff0a7,
title = "Color Connection and Disconnection",
abstract = "Much of the research in graph theory has dealt with connected graphs. While there are many measures of connectedness for graphs, the two best known are the (vertex) connectivity and edge connectivity, the definitions of which deal with the concepts of vertex-cuts and edge-cuts, respectively. In this chapter, we discuss topics related to these two types of connectedness where coloring also plays a role in each instance.",
author = "Gary Chartrand and Haynes, \{Teresa W.\} and Henning, \{Michael A.\} and Ping Zhang",
note = "Publisher Copyright: {\textcopyright} 2019, The Author(s), under exclusive license to Springer Nature Switzerland AG.",
year = "2019",
doi = "10.1007/978-3-030-31110-0\_8",
language = "English",
series = "SpringerBriefs in Mathematics",
publisher = "Springer Science and Business Media B.V.",
pages = "81--94",
booktitle = "SpringerBriefs in Mathematics",
address = "Germany",
}