On the problem of finding small subdivision and homomorphism bases for classes of countable graphs

DOI10.1016/S0012-365X(85)80018-2zbMath0571.05042MaRDI QIDQ1061752

Reinhard Diestel

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

forbidden configurationsprime graphssimplicial decompositionscountable graphssubcontractionhomomorphism base

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

Simplicial decompositions of graphs: A survey of applications, Universal elements and the complexity of certain classes of infinite graphs, Some remarks on universal graphs, On universal graphs with forbidden topological subgraphs, Simplicial decompositions of graphs - some uniqueness results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simplicial decompositions of graphs - some uniqueness results
• Über eine Eigenschaft der ebenen Komplexe
• Simplicial Decompositions: Some New Aspects and Applications
• Universal graphs and universal functions
• Some remarks on universal graphs