Sciweavers

22 search results - page 1 / 5
» Two disjoint negative cycles in a signed graph
Sort
View
ENDM
2006
58views more  ENDM 2006»
15 years 4 months ago
Two disjoint negative cycles in a signed graph
Winfried Hochstättler, Robert Nickel, Britta ...
145
Voted
JCT
2007
78views more  JCT 2007»
15 years 4 months ago
Projective-planar signed graphs and tangled signed graphs
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...
Daniel C. Slilaty
128
Voted
CPC
2008
114views more  CPC 2008»
15 years 5 months ago
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
In 1998 Luczak, R
Peter Allen
NETWORKS
2007
15 years 4 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
JCT
2010
112views more  JCT 2010»
15 years 3 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra