Pre-signed graphs: a reformulation of signed graphs and their embeddings
From MaRDI portal
Cites work
- A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case
- A combinatorial analog of the Jordan Curve Theorem
- A duality for permutations
- A mathematical bibliography of signed and gain graphs and allied areas
- A Nebeský-type characterization for relative maximum genus
- Additivity of the genus of a graph
- An Euler-genus approach to the calculation of the crosscap-number polynomial
- An Introduction to Random Topological Graph Theory
- Bounds for the average genus of the vertex-amalgamation of graphs
- Characterization of signed graphs which are cellularly embeddable in no more than one surface
- Characterization of the maximum genus of a signed graph
- Combinatorial conjectures that imply local log-concavity of graph genus polynomials
- Combinatorics of orientation reversing polygons
- Duke's theorem does not extend to signed graph embeddings
- Embedding digraphs on orientable surfaces
- Generalized Embedding Schemes
- Genus distributions for bouquets of circles
- Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
- Graph-encoded maps
- Homomorphisms of signed graphs: an update
- How many ways can a permutation be factored into two n-cycles?
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3685513 (Why is no real title available?)
- scientific article; zbMATH DE number 3587060 (Why is no real title available?)
- scientific article; zbMATH DE number 637276 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 1409183 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- On the genus distributions of wheels and of related graphs
- On the notion of balance of a signed graph
- Orientation embedding of signed graphs
- Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
- Random 2-cell embeddings of multistars
- Region distributions of some small diameter graphs
- Signed graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The Genera of Amalgamations of Graphs
- The genus of the 2-amalgamations of graphs
- The largest demigenus over all signatures on \(K_{3,n}\)
- The largest parity demigenus of a simple graph
- The nonorientable genus is additive
- The order upper bound on parity embedding of a graph
- The orientable genus is nonadditive
- The projective-planar signed graphs
- The relative maximum genus of a graph
- The smallest surface that contains all signed graphs on \(K_{4, n}\)
This page was built for publication: Pre-signed graphs: a reformulation of signed graphs and their embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848318)