On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
DOI10.26493/1855-3974.2910.5b3zbMATH Open1548.05243MaRDI QIDQ6619397
Publication date: 15 October 2024
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Embedding (54C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
- Square integer Heffter arrays with empty cells
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- Exponential families of non-isomorphic triangulations of complete graphs
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
- On the existence of integer relative Heffter arrays
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Heffter arrays and biembedding graphs on surfaces
- Rectangular Heffter arrays: a reduction theorem
- Graphs on surfaces
- Generating nonisomorphic quadrangular embeddings of a complete graph
- On the number of triangular embeddings of complete graphs and complete tripartite graphs
- Combinatorial Local Planarity and the Width of Graph Embeddings
- Recursive constructions for triangulations
- Biembedding Steiner Triple Systems and n-cycle Systems on Orientable Surfaces
- The existence of square integer Heffter arrays
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Relative Heffter arrays and biembeddings
- A tour problem on a toroidal board
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s
- The existence of square non-integer Heffter arrays
- Hamiltonian embeddings from triangulations
- A generalization of Heffter arrays
- Biembeddings of cycle systems using integer Heffter arrays
- A survey of Heffter arrays
Related Items (1)
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)