The complexity of a class of infinite graphs

DOI10.1007/BF01305955zbMath0795.05121OpenAlexW2027176695WikidataQ104377296 ScholiaQ104377296MaRDI QIDQ1323483

János Pach, Péter Komjáth

Publication date: 4 September 1994

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01305955

zbMATH Keywords

universal graphsvertex-disjoint cyclesedge-disjoint cycles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (1)

Nonexistence of universal graphs without some trees

Cites Work

• Some universal graphs
• Universal elements and the complexity of certain classes of infinite graphs
• Universal graphs without large bipartite subgraphs
• There is no universal countable pentagon‐free graph
• Universal graphs and universal functions

This page was built for publication: The complexity of a class of infinite graphs