लोड हो रहा है...
Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges
Let be a 4-connected graph, and let denote the set of those edges of which are not contained in a triangle, and let denote the set of 4-contractible edges of . We show that if or , then unless has one of the three specified configurations.
में बचाया:
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Taylor & Francis Group
2018-08-01
|
| श्रृंखला: | AKCE International Journal of Graphs and Combinatorics |
| विषय: | |
| ऑनलाइन पहुंच: | http://dx.doi.org/10.1016/j.akcej.2017.09.002 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|