On the number of non-isomorphic (simple) k-gonal biembeddings of complete multipartite graphs
From MaRDI portal
(Redirected from Publication:6619397)
On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Embedding (54C25)
Recommendations
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- Biembeddings of cycle systems using integer Heffter arrays
- scientific article; zbMATH DE number 841626
- Exponential families of non-isomorphic triangulations of complete graphs
Cites work
- A generalization of Heffter arrays
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- A survey of Heffter arrays
- A tour problem on a toroidal board
- Biembedding Steiner triple systems and n-cycle systems on orientable surfaces
- Biembeddings of cycle systems using integer Heffter arrays
- Combinatorial Local Planarity and the Width of Graph Embeddings
- Design and topology
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Exponential families of non-isomorphic triangulations of complete graphs
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
- Generating nonisomorphic quadrangular embeddings of a complete graph
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Graphs on surfaces
- Hamiltonian embeddings from triangulations
- Heffter arrays and biembedding graphs on surfaces
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
- On the existence of integer relative Heffter arrays
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- On the number of triangular embeddings of complete graphs and complete tripartite graphs
- Rectangular Heffter arrays: a reduction theorem
- Recursive constructions for triangulations
- Relative Heffter arrays and biembeddings
- Square integer Heffter arrays with empty cells
- The CRC handbook of combinatorial designs
- The existence of square integer Heffter arrays
- The existence of square non-integer Heffter arrays
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
Cited in
(3)
This page was built for publication: On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619397)
