Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

COMBINATORICS
2006

favoriteEmaildiscussreport

100views more COMBINATORICS 2006»

Parity Versions of 2-Connectedness

13 years 4 months ago

Parity Versions of 2-Connectedness

Download www.maths.tcd.ie

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.

C. Little, A. Vince

Real-time Traffic

COMBINATORICS 2006 | Dual Even-realizable Graphs | Familiar Graph | Parity Versions |

claim paper

Related Content

» Subset Selection in TypeII Hybrid ARQFEC for Video Multicast

» Multistream partitioning and parity rate allocation for scalable IPTV delivery

» On Girth Conditioning for LowDensity ParityCheck Codes

» Settling the Complexity of Computing TwoPlayer Nash Equilibria

» A novel LDPC decoder for DVBS2 IP

» Bilayer LowDensity ParityCheck Codes for DecodeandForward in Relay Channels

» Simple Fast Parallel Hashing

» A tight lower bound for parity in noisy communication networks

» Semantic security for the McEliece cryptosystem without random oracles

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	C. Little, A. Vince

Comments (0)