Projective-planar signed graphs and tangled signed graphs

• Autores: Daniel Slilaty
• Localización: Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 97, Nº. 5, 2007, págs. 693-717
• Idioma: inglés
• DOI: 10.1016/j.jctb.2006.10.002
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.