The Factorization of Locally Finite Graphs

DOI10.4153/CJM-1950-005-2MaRDI QIDQ5794931zbMATH OpenOpenAlexFDO

Authors William T. Tutte

Publication date 1950

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1950-005-2

zbMATH Keywords

Topology

Cited in

(16)

• The Edmonds-Gallai decomposition for matchings in locally finite graphs
• A note on f-factors in directed and undirected multigraphs
• On the factorization of graphs with exactly one vertex of infinite degree
• On the number of 1-factors of locally finite graphs
• Non-bipartite graphs of girth 4
• A factorization theorem for a certain class of graphs
• Maximal-\(\Gamma\)-prime Graphen
• Graphs and Subgraphs
• Factors and factorizations of graphs—a survey
• Matchings in infinite graphs
• On factorisation of graphs
• Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
• Closure results for arbitrarily partitionable graphs
• Toughness properties of arbitrarily partitionable graphs
• A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
• Regular factors in nearly regular graphs

This page was built for publication: The Factorization of Locally Finite Graphs

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