Name
Abstract | ||
|---|---|---|
A graph Γ is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according to whether its length is even or odd. The parity demigenus of Γ is the minimum of 2− χ ( S ) (where χ is the Euler characteristic) over all surfaces S in which Γ can be parity embedded. We calculate the maximum parity demigenus over all graphs, simple or not, of order n . |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jctb.1996.0060 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
upper bound,euler characteristic | Discrete mathematics,Combinatorics,Line graph,Bound graph,Upper and lower bounds,Cubic graph,Euler characteristic,Parity (mathematics),Mathematics,Planar graph,Complement graph | Journal |
Volume | Issue | ISSN |
68 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
4 | 0.75 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Zaslavsky | 1 | 297 | 56.67 |