Block designs and graph imbeddings
DOI10.1016/0095-8956(78)90036-9zbMath0328.05009OpenAlexW2039191934MaRDI QIDQ1226489
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90036-9
Combinatorial aspects of block designs (05B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Twofold triple systems and graph imbeddings
- Quotients of complete graphs: revisiting the Heawood map-coloring problem
- The genus of the symmetric quadripartite graph
- Genus embeddings for some complete tripartite graphs
- Balanced incomplete block designs and related designs
- Orientable imbeddings of Cayley graphs
- On 1-factorability and edge-colorability of Cartesian products of graphs
- Voltage graphs
- Das Geschlecht des vollständigen dreifärbbaren Graphen
- On the Genus of Strong Tensor Products of Graphs
- On 2-cell imbeddings of complete n-partite graphs
- Branched coverings of graph imbeddings
- Solution of the Heawood map-coloring problem—case 11
- The genus of the complete tripartite graph Kmn,n,n
This page was built for publication: Block designs and graph imbeddings