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.®
- Keyword
-
- Additive Bases (1)
- Cartan (1)
- Collapsible graph (1)
- Cycle double covers (1)
- Excluded matroid minor (1)
-
- Face coloring problem (1)
- Graphic Sequence (1)
- Group Connectivity (1)
- Integer flows (1)
- Limit and prolongation limit sets (1)
- Line graph (1)
- Matching Number (1)
- Matroid circuit graph (1)
- Modulo Orientation (1)
- Nets in Topological group (1)
- Nowhere-zero Flow (1)
- Proper actions (1)
- Proper mapping (1)
- Reduced graph (1)
- S-hamiltonian (1)
- S-hamiltonian connected (1)
- Signed Graph (1)
- Slices (1)
- Small set (1)
- Supereulerian graph (1)
- Thin sets (1)
- Topological Groups (1)
- Weighted Modulo Orientation (1)
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Circuits And Cycles In Graphs And Matroids, Yang Wu
Circuits And Cycles In Graphs And Matroids, Yang Wu
Graduate Theses, Dissertations, and Problem Reports
This dissertation mainly focuses on characterizing cycles and circuits in graphs, line graphs and matroids. We obtain the following advances.
1. Results in graphs and line graphs. For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line graph Ln(G) is panconnected. A path P is a divalent path of G if the internal vertices of P are of degree 2 in G. If every edge of P is a cut edge of G, then P is a bridge divalent path of G; …
Weighted Modulo Orientations Of Graphs, Jianbing Liu
Weighted Modulo Orientations Of Graphs, Jianbing Liu
Graduate Theses, Dissertations, and Problem Reports
This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte's 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte's 3-Flow Conjecture (1972) states that every 4-edge-connected graph admits a nowhere-zero 3-flow. Extending Tutte's flows conjectures, Jaeger's Circular Flow Conjecture (1981) says every 4k-edge-connected graph admits a modulo (2k+1)-orientation, that is, an orientation such that the indegree is congruent to outdegree modulo (2k+1) at every vertex. Note that the k=1 case of Circular Flow Conjecture coincides with the 3-Flow Conjecture, and the case of k=2 implies the 5-Flow Conjecture. This work is devoted …
Cycle Double Covers And Integer Flows, Zhang Zhang
Cycle Double Covers And Integer Flows, Zhang Zhang
Graduate Theses, Dissertations, and Problem Reports
My research focuses on two famous problems in graph theory, namely the cycle double cover conjecture and the integer flows conjectures. This kind of problem is undoubtedly one of the major catalysts in the tremendous development of graph theory. It was observed by Tutte that the Four color problem can be formulated in terms of integer flows, as well as cycle covers. Since then, the topics of integer flows and cycle covers have always been in the main line of graph theory research. This dissertation provides several partial results on these two classes of problems.
Theory And Techniques Of Convergence Of Topological Transformation Group Actions, Murtadha Jaber Sarray
Theory And Techniques Of Convergence Of Topological Transformation Group Actions, Murtadha Jaber Sarray
Graduate Theses, Dissertations, and Problem Reports
n this dissertation, we present new set functions called strongly limit and strongly prolongation limit sets. We show the new sets, especially strongly prolongation limit sets, characterize proper action under an arbitrary setting. That is, we characterize proper action for wider class of proper ܩ-spaces. Also, we show the new version of the sets could be derived from strongly exceptional sets which have been used as a good technique for the characterization of a proper maps. Moreover, we review properties of well-known limit sets and prolongations and properties for the new version of limit sets under an arbitrary setting on …