Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Properties Of Catlin’S Reduced Graphs And Supereulerian Graphs, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu
Properties Of Catlin’S Reduced Graphs And Supereulerian Graphs, Wei-Guo Chen, Zhi-Hong Chen, Mei Lu
Scholarship and Professional Work - LAS
A graph G is called collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph H of G such that R is the set of vertices of odd degree in H. A graph is the reduction of G if it is obtained from G by contracting all the nontrivial collapsible subgraphs. A graph is reduced if it has no nontrivial collapsible subgraphs. In this paper, we first prove a few results on the properties of reduced graphs. As an application, for 3-edge-connected graphs G of order n with d(u) + d(v) ≥ 2(n/p − …
Edge-Connectivities For Spanning Trails With Prescribed Edges, Wei-Guo Chen, Zhi-Hong Chen, Weiqi Luo
Edge-Connectivities For Spanning Trails With Prescribed Edges, Wei-Guo Chen, Zhi-Hong Chen, Weiqi Luo
Scholarship and Professional Work - LAS
No abstract provided.
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen
The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.