Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
From MaRDI portal
Cited in
(10)- A tribute to Frank Harary (in honor of his 70th birthday)
- The 6-girth-thickness of the complete graph
- Current graphs and bi-embeddings
- On the bigenus of the complete graphs
- The 4-girth-thickness of the complete multipartite graph
- On the toroidal thickness of graphs
- Nordhaus-Gaddum type inequalities for tree covering numbers on unitary Cayley graphs of finite rings
- The toroidal thickness of the symmetric quadripartite graph
- Index 3 biembeddings of the complete graphs
- Infinite families of bi-embeddings
This page was built for publication: Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573119)