Parity Versions of 2-Connectedness

  • C. Little
  • A. Vince
DOI: https://doi.org/10.37236/1122

Abstract

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.

Published
2006-10-31
How to Cite
Little, C., & Vince, A. (2006). Parity Versions of 2-Connectedness. The Electronic Journal of Combinatorics, 13(1), #R96. https://doi.org/10.37236/1122
Issue
Volume 13 (2006)
Article Number
R96