A problem of Ulam on planar graphs

DOI10.1016/S0195-6698(81)80043-1zbMath0469.05027DBLPjournals/ejc/Pach81OpenAlexW1969779430WikidataQ56853077 ScholiaQ56853077MaRDI QIDQ1156811

János Pach

Publication date: 1981

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80043-1

zbMATH Keywords

countable planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (11)

Simplicial decompositions of graphs: A survey of applications ⋮ Some universal graphs ⋮ Universal graphs for the topological minor relation ⋮ A universal planar graph under the minor relation ⋮ Universal end-compactifications of locally finite graphs ⋮ Universal elements and the complexity of certain classes of infinite graphs ⋮ Some remarks on universal graphs ⋮ Universal graphs with a forbidden near‐path or 2‐bouquet ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Universal graphs with forbidden subgraphs and algebraic closure ⋮ On universal graphs with forbidden topological subgraphs

Cites Work

• Notes on combinatorial set theory
• Universal graphs and universal functions
• Homogeneous Universal Relational Systems.
• Remarks on Some Theorems of Rado on Universal Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A problem of Ulam on planar graphs