scholarly journals The edmonds—Gallai decomposition for matchings in locally finite graphs

COMBINATORICA ◽  
1982 ◽  
Vol 2 (3) ◽  
pp. 229-235 ◽  
Author(s):  
François Bry ◽  
Michel Las Vergnas
Keyword(s):  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs

Canonical edge-colourings of locally finite graphs

COMBINATORICA ◽  
1982 ◽  
Vol 2 (1) ◽  
pp. 37-51 ◽  
Author(s):  
A. J. W. Hilton
Keyword(s):  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Edge Colourings

scholarly journals Spanning trees of locally finite graphs

1989 ◽  
Vol 39 (2) ◽  
pp. 193-197
Author(s):  
Bohdan Zelinka
Keyword(s):  
Spanning Trees ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs

scholarly journals Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite Graphs

10.37236/6083 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Johannes Carmesin
Keyword(s):  
Type Theorem ◽  
Main Tool ◽  
Infinite Graphs ◽  
Disjoint Paths ◽  
Natural Topology ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Vertex Sets ◽  
Special Case

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid.As our main tool, we prove for any infinite graph $G$ with vertex-sets $A$ and $B$, if every finite subset of $A$ is linked to $B$ by disjoint paths, then the whole of $A$ can be linked to the closure of $B$ by disjoint paths or rays in a natural topology on $G$ and its ends.This latter theorem implies the topological Menger theorem of Diestel for locally finite graphs. It also implies a special case of the infinite Menger theorem of Aharoni and Berger.

scholarly journals The Structure of Locally Finite Two-Connected Graphs

10.37236/1211 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Carl Droms ◽  
Brigitte Servatius ◽  
Herman Servatius
Keyword(s):  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Locally Finite ◽  
Connected Graphs ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Necessary And Sufficient ◽  
Block Tree ◽  
Labeled Tree

We expand on Tutte's theory of $3$-blocks for $2$-connected graphs, generalizing it to apply to infinite, locally finite graphs, and giving necessary and sufficient conditions for a labeled tree to be the $3$-block tree of a $2$-connected graph.

scholarly journals Hamilton Cycles in Planar Locally Finite Graphs

2008 ◽  
Vol 22 (4) ◽  
pp. 1381-1392 ◽  
Author(s):  
Henning Bruhn ◽  
Xingxing Yu
Keyword(s):  
Hamilton Cycles ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs

Matchings in Arbitrary Graphs

1971 ◽  
Vol 69 (3) ◽  
pp. 401-407 ◽  
Author(s):  
R. A. Brualdi
Keyword(s):  
Perfect Matching ◽  
Sufficient Conditions ◽  
Finite Graph ◽  
Maximum Cardinality ◽  
Original Proof ◽  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs ◽  
Arbitrary Graphs ◽  
Necessary And Sufficient

1. Tutte(10) has given necessary and sufficient conditions in order that a finite graph have a perfect matching. A different proof was given by Gallai(4). Berge(1) (and Ore (7)) generalized Tutte's result by determining the maximum cardinality of a matching in a finite graph. In his original proof Tutte used the method of skew symmetric determinants (or pfaffians) while Gallai and Berge used the much exploited method of alternating paths. Another proof of Berge's theorem, along with an efficient algorithm for constructing a matching of maximum cardinality, was given by Edmonds (2). In another paper (12) Tutte extended his conditions for a perfect matching to locally finite graphs.

scholarly journals Finite Separating Sets in Locally Finite Graphs

1993 ◽  
Vol 59 (1) ◽  
pp. 15-25 ◽  
Author(s):  
H.A. Jung ◽  
M.E. Watkins
Keyword(s):  
Locally Finite ◽  
Finite Graphs ◽  
Locally Finite Graphs
Sign in / Sign up

Export Citation Format

Share Document