论文信息 - Upper embeddability and connectivity of graphs

Upper embeddability and connectivity of graphs

In this paper, we prove that every cyclically 4-edge-connected graph is upper-embeddable. The proof is based on the study of the effect on the maximum genus of a graph when one of its subgraphs is collapsed to a vertex.

Charles Payan | Nguyen Huy Xuong

[1] Sukhamay Kundu,et al. Bounds on the number of disjoint spanning trees , 1974 .

[2] C. Berge. Graphes et hypergraphes , 1970 .

[3] G. Ringel. Map Color Theorem , 1974 .

[4] Arthur T. White,et al. On the maximum genus of a graph , 1971 .