Sciweavers

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

10

JCT
2007

favoriteEmaildiscussreport

78views more JCT 2007»

Projective-planar signed graphs and tangled signed graphs

13 years 4 months ago

Projective-planar signed graphs and tangled signed graphs

Download www.math.wright.edu

A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex is obtained by taking a projective-planar signed graph or a copy of −K5 and then taking 1, 2, and 3-sums with balanced signed graphs.

Daniel C. Slilaty

Real-time Traffic

JCT 2007 | Projective-planar Signed Graph | Signed Graph | Vertex-disjoint Negative Circles |

claim paper

Related Content

» Product Line Sigraphs

» Spectral Analysis of kBalanced Signed Graphs

» Signed analogs of bipartite graphs

» Low rank modeling of signed networks

» Computing the graphbased parallel complexity of gene assembly

» Cubic time recognition of cocircuit graphs of uniform oriented matroids

» Decompositions of signedgraphic matroids

» Spectral Analysis of Signed Graphs for Clustering Prediction and Visualization

» Bounds on the signed domination number of a graph

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Daniel C. Slilaty

Comments (0)