Parity Versions of 2-Connectedness

This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characterized. The realizable, even-realizable, alternating-realizable, dual realizable and dual even-realizable graphs are classified.

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: C. Little, A. Vince
• Keywords: COMBINATORICS 2006, Dual Even-realizable Graphs, Familiar Graph, Parity Versions