Decomposition of Graphs Into Closed and Endless Chains

DOI10.1112/PLMS/S3-10.1.221MaRDI QIDQ3273707zbMATH OpenOpenAlexFDO

Authors C. St. J. A. Nash-Williams

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

zbMATH Keywords

topology

Cited in

(17)

• A compactness result for perfect matchings
• 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
• A compactness theorem for perfect matchings in matroids
• Topological paths, cycles and spanning trees in infinite graphs
• Elementary submodels in infinite combinatorics
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Decompositions of infinite graphs. II: Circuit decompositions
• Graphs in which every finite path is contained in a circuit
• The Lovász-Cherkassky theorem in countable graphs
• Chain decompositions of graphs
• Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
• On partitioning the edges of an infinite digraph into directed cycles
• Eulerian Spaces
• The Lovász-Cherkassky theorem in infinite graphs
• Circuit-partition of infinite matroids

This page was built for publication: Decomposition of Graphs Into Closed and Endless Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3273707)