# The largest demigenus of a bipartite signed graph

@article{Zaslavsky2001TheLD, title={The largest demigenus of a bipartite signed graph}, author={Thomas Zaslavsky}, journal={Discret. Math.}, year={2001}, volume={232}, pages={189-193} }

Abstract A graph with signed edges is orientation embedded in a surface when it is topologically embedded so that one trip around a closed path preserves or reverses orientation according as the path's sign product is positive or negative. We find the smallest surface within which it is possible to orientation-embed the complete bipartite signed graph ±K r,s , which is obtained from the complete bipartite graph K r,s through replacing each edge by two parallel edges, one positive and the other… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

## The Largest Demigenus Over All Signatures on K3,n

VIEW 6 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.

SHOWING 1-9 OF 9 REFERENCES

## The Largest Parity Demigenus of a Simple Graph

VIEW 4 EXCERPTS

## Characterization of the maximum genus of a signed graph

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## The Order Upper Bound on Parity Embedding of a Graph

VIEW 3 EXCERPTS