On the toroidal thickness of graphs

DOI10.1002/JGT.3190060212MaRDI QIDQ3947683zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947683)