\(T\)-joins in infinite graphs

zbMath1367.05146MaRDI QIDQ2363692

Attila Joó

Publication date: 26 July 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p2

zbMATH Keywords

infinite graph\(T\)-join

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Infinite graphs (05C63)

Related Items (1)

The Lovász-Cherkassky theorem in countable graphs

Cites Work

• Elementary submodels in infinite combinatorics
• Unnamed Item
• Unnamed Item

This page was built for publication: \(T\)-joins in infinite graphs