In order to accommodate bond orders we allow multi-edges. The degree of a vertex x ∈ V (G), denoted by deg G (x), is then simply the number of incident edges, i.e., the multiplicity of edges is accounted for in the degree. For ease of presentation we will consider undirected, i.e., symmetric graphs throughout the main text. Extensions to the directed setting are outlined briefly in the Appendix.