Skip to main content
Article
Projective-Planar Signed Graphs and Tangled Signed Graphs
Journal of Combinatorial Theory, Series B
  • Dan Slilaty, Wright State University - Main Campus
Document Type
Article
Publication Date
1-1-2007
Abstract

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" role="presentation" style="box-sizing: border-box; margin: 0px; padding: 0px; display: inline-block; line-height: normal; font-size: 16.2px; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; position: relative;">−K5 and then taking 1-, 2-, and 3-sums with balanced signed grap

DOI
10.1016/j.jctb.2006.10.002
Citation Information
Dan Slilaty. "Projective-Planar Signed Graphs and Tangled Signed Graphs" Journal of Combinatorial Theory, Series B Vol. 97 Iss. 5 (2007) p. 693 - 717 ISSN: 0095-8956
Available at: http://works.bepress.com/dan_slilaty/21/