Irreducibly Odd Graphs

Details Irreducibly Odd Graphs Irreducibly Odd Graphs

2010-08-18

arxiv.org/abs/1008.3163v2

Mathematics

Combinatorics

8 pages, 7 figures, 1 table

Scientific paper

An irreducibly odd graph is a graph such that each vertex has odd degree and for every pair of vertices, a third vertex in the graph is adjacent to exactly one of the pair. This family of graphs was introduced recently by Manturov in relation to free knots. In this paper, we show that every graph is the induced subgraph of an irreducibly odd graph. Furthermore, we prove that irreducibly odd graphs must contain a particular minor called the triskelion.

Affiliated with

Also associated with

No associations

Rating

Irreducibly Odd Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Irreducibly Odd Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Irreducibly Odd Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134326