论文信息 - Matchings in polytopal graphs

Matchings in polytopal graphs

Abstract : A matching M of a graph G is a set of edges of G such that each vertex of G is incident with a most one edge of M, and that no edge of G may be added to M without violating this restriction. A number of new results on matchings are obtained, in particular concerning planar and polytopal graphs. A typical result is the following one which deals with (pi bar)(G), the largest possible number of edge-disjoint matchings of G. Theorem: The largest value of (pi bar)(G), possible for 3-polytopal graphs G is 12. (Author)

Branko Grünbaum | B. Grünbaum

[1] F. Baebler. Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung , 1937 .

[2] R. Forcade,et al. Smallest maximal matchings in the graph of the d-dimensional cube , 1973 .

[3] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[4] G. Chartrand,et al. Graphs with Forbidden Subgraphs , 1971 .

[5] J. Petersen. Die Theorie der regulären graphs , 1891 .

[6] B. Grünbaum. Acyclic colorings of planar graphs , 1973 .

[7] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[8] P. McMullen. The maximum numbers of faces of a convex polytope , 1970 .

[9] R. Z. Norman,et al. An algorithm for a minimum cover of a graph , 1959 .

[10] H. Finck,et al. Einführung in die Theorie der endlichen Graphen , 1971 .

[11] V. Klee. On the Number of Vertices of a Convex Polytope , 1964, Canadian Journal of Mathematics.

[12] B. Grünbaum. Polytopes, graphs, and complexes , 1970 .

[13] Joseph M. Weinstein. On the number of disjoint edges in a graph , 1963 .