A note on the directed genus of K_n,n,n and K_n
From MaRDI portal
Publication:4577874
DOI10.26493/1855-3974.911.3b4zbMath1395.05045OpenAlexW2781922846MaRDI QIDQ4577874
Publication date: 3 August 2018
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.911.3b4
Combinatorial aspects of block designs (05B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Triple systems (05B07)
Related Items (2)
Nonseparating independent sets and maximum genus of graphs ⋮ A note on directed genera of some tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs
- A construction for biembeddings of Latin squares
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- Genus distribution of graphs under surgery: adding edges and splitting vertices
- The directed genus of the de Bruijn graph
- Genus embeddings for some complete tripartite graphs
- How to determine the maximum genus of a graph
- Genus distributions for bouquets of circles
- Total embedding distributions for bouquets of circles
- The genus distributions of directed antiladders in orientable surfaces
- The graph genus problem is NP-complete
- Hierarchy for imbedding-distribution invariants of a graph
- Permutation-Partition Pairs II: Bounds on the Genus of the Amalgamation of Graphs
This page was built for publication: A note on the directed genus of K_n,n,n and K_n