We prove that if G is a 2-edge-connected simple graph with p verti- ces and at least +7 edges,then G other than the complete bipartite graph K_(2,5) has a connected eulerian spanning subgraph and also give all the six...We prove that if G is a 2-edge-connected simple graph with p verti- ces and at least +7 edges,then G other than the complete bipartite graph K_(2,5) has a connected eulerian spanning subgraph and also give all the six extremal graphs with ()+6 edges and edge connectivety K'(G)=2.展开更多
The graphs we discuss are supposed to be undirected and finite with no multiple edges or loops. Given a graph G, a spanning circuit, or S-circuit, of G is a closed trail that contains the same vertices as those of G. ...The graphs we discuss are supposed to be undirected and finite with no multiple edges or loops. Given a graph G, a spanning circuit, or S-circuit, of G is a closed trail that contains the same vertices as those of G. A connected graph G is called an almost bridgeless graph if every bridge of G is incident with a vertex of degree 1.展开更多
基金Supported by Natural Science Foundation of Shandong Province(ZR2015HL095)Science and Technology Development Plan of Tan'an City(2015NS2159)Taishan Medical University Doctor Foundation(20072009)~~
文摘We prove that if G is a 2-edge-connected simple graph with p verti- ces and at least +7 edges,then G other than the complete bipartite graph K_(2,5) has a connected eulerian spanning subgraph and also give all the six extremal graphs with ()+6 edges and edge connectivety K'(G)=2.
文摘The graphs we discuss are supposed to be undirected and finite with no multiple edges or loops. Given a graph G, a spanning circuit, or S-circuit, of G is a closed trail that contains the same vertices as those of G. A connected graph G is called an almost bridgeless graph if every bridge of G is incident with a vertex of degree 1.
