Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2010 | Clinical Orthopaedics and Related Research | virtual knot. 1,triskelion,graph,graph minor,. free knot,morn- ingstar,irreducibly odd,knot |
Field | DocType | Volume |
Odd graph,Combinatorics,Indifference graph,Robertson–Seymour theorem,Forbidden graph characterization,Graph homomorphism,Symmetric graph,Universal graph,1-planar graph,Mathematics | Journal | abs/1008.3 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomas J. Boothby | 1 | 4 | 0.77 |
| Allison Henrich | 2 | 0 | 1.01 |