The Factorization of Locally Finite Graphs

W. T. Tutte

doi:10.4153/CJM-1950-005-2

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

1. Introduction. A graph G consists of a set V(G) of objects called nodes and a set M (G) of objects called links, V(G) and M (G) having no members in common. With each link A there is associated just two nodes said to be the ends of A, or to be incident with A, or to be joined by A. The sets V(G) and M(G) may be finite or infinite. There may be nodes with which no link is incident. Such nodes are said to be isolated.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Gallai, T. 1950. On factorisation of graphs. Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 1, Issue. 1, p. 133.

Tutte, W. T. 1952. The Factors of Graphs. Canadian Journal of Mathematics, Vol. 4, Issue. , p. 314.

Tutte, W. T. 1953. The 1-factors of oriented graphs. Proceedings of the American Mathematical Society, Vol. 4, Issue. 6, p. 922.

Ore, Oystein 1957. Graphs and subgraphs. Transactions of the American Mathematical Society, Vol. 84, Issue. 1, p. 109.

Jung, H. A. 1964. Maximal-?-prime Graphen. Mathematische Annalen, Vol. 153, Issue. 3, p. 210.

Nash-Williams, C.St.J.A. 1967. Infinite graphs—A survey. Journal of Combinatorial Theory, Vol. 3, Issue. 3, p. 286.

Brualdi, R. A. 1971. Matchings in Arbitrary Graphs. Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 69, Issue. 3, p. 401.

1973. Graphs and Hypergraphs. Vol. 6, Issue. , p. 498.

Kundu, Sukhamay 1974. A factorization theorem for a certain class of graphs. Discrete Mathematics, Vol. 8, Issue. 1, p. 41.

Bry, François and Las Vergnas, Michel 1982. The edmonds—Gallai decomposition for matchings in locally finite graphs. Combinatorica, Vol. 2, Issue. 3, p. 229.

Bry, François 1983. On the factorization of graphs with exactly one vertex of infinite degree. Discrete Mathematics, Vol. 43, Issue. 2-3, p. 317.

Bry, François 1983. On the number of 1-factors of locally finite graphs. Journal of Combinatorial Theory, Series B, Vol. 34, Issue. 1, p. 48.

Bermond, Jean-Claude and Las Vergnas, Michel 1984. Regular factors in nearly regular graphs. Discrete Mathematics, Vol. 50, Issue. , p. 9.

Akiyama, Jin and Kano, Mikio 1985. Factors and factorizations of graphs—a survey. Journal of Graph Theory, Vol. 9, Issue. 1, p. 1.

Fraisse, Pierre Hell, Pavol and Kirkpatrick, David G. 1986. A note onf-factors in directed and undirected multigraphs. Graphs and Combinatorics, Vol. 2, Issue. 1, p. 61.

Tutte, W. T. 2009. Classic Papers in Combinatorics. p. 164.

Clark, Pete L. 2013. Graph Derangements. Open Journal of Discrete Mathematics, Vol. 03, Issue. 04, p. 183.

Damle, Kedar 2022. Theory of collective topologically protected Majorana fermion excitations of networks of localized Majorana modes. Physical Review B, Vol. 105, Issue. 23,

Hollway, James 2023.

CrossRef

Article contents

The Factorization of Locally Finite Graphs

Extract

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests