Characterization of the maximum genus of a signed graph
From MaRDI portal
Publication:1179472
DOI10.1016/0095-8956(91)90099-6zbMath0742.05037OpenAlexW2034000616MaRDI QIDQ1179472
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90099-6
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (12)
Unnamed Item ⋮ Circuit Covers of Signed Graphs ⋮ A note on disjoint cycles ⋮ Odd Decompositions of Eulerian Graphs ⋮ Characterization of signed graphs which are cellularly embeddable in no more than one surface ⋮ The largest demigenus over all signatures on \(K_{3,n}\) ⋮ Duke's theorem does not extend to signed graph embeddings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Nebeský-type characterization for relative maximum genus ⋮ Heffter arrays and biembedding graphs on surfaces ⋮ The maximum genus, matchings and the cycle space of a graph
Cites Work
- Signed graphs
- Applications of topological graph theory to group theory
- How to determine the maximum genus of a graph
- The nonorientable genus is additive
- Relative Embeddings of Graphs on Closed Surfaces
- A new characterization of the maximum genus of a graph
- Orientation embedding of signed graphs
- A Characterization in of Upper-Embeddable Graphs
- The combinatorial map color theorem
- Generalized Embedding Schemes
- On the surface duality of linear graphs
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterization of the maximum genus of a signed graph
