On the toroidal thickness of graphs

DOI10.1002/jgt.3190060212zbMath0487.05024OpenAlexW2101385319MaRDI QIDQ3947683

Ian Anderson

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060212

zbMATH Keywords

embeddingsgraph decompositionSkolem triples

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

The toroidal thickness of the symmetric quadripartite graph ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Triples, current graphs and biembeddings

Cites Work

• On certain distributions of integers in pairs with given differences
• A Note on Steiner Triple Systems.
• Verification of a Conjecture of Th. Skolem.
• Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
• On Steiner and Similar Triple Systems.

This page was built for publication: On the toroidal thickness of graphs