Decomposition of Graphs Into Closed and Endless Chains
From MaRDI portal
Publication:3273707
DOI10.1112/plms/s3-10.1.221zbMath0095.37901OpenAlexW2093392273MaRDI QIDQ3273707
Publication date: 1960
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-10.1.221
Related Items (15)
Topological paths, cycles and spanning trees in infinite graphs ⋮ A compactness result for perfect matchings ⋮ Chain decompositions of graphs ⋮ The Lovász-Cherkassky theorem in countable graphs ⋮ Eulerian Spaces ⋮ Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs ⋮ Sous-graphes tracables des graphes infinis ⋮ Couplages et transversaux généralises d'un hypergraphe infini ⋮ Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets ⋮ On Partitioning the Edges of an Infinite Digraph into Directed Cycles ⋮ Decompositions of infinite graphs. I: Bond-faithful decompositions ⋮ Decompositions of infinite graphs. II: Circuit decompositions ⋮ Elementary submodels in infinite combinatorics ⋮ A compactness theorem for perfect matchings in matroids ⋮ Graphs in which every finite path is contained in a circuit
This page was built for publication: Decomposition of Graphs Into Closed and Endless Chains
