Large Degree Vertices in Longest Cycles of Graphs, I
In this paper, we consider the least integer d such that every longest cycle of a k-connected graph of order n (and of independent number α) contains all vertices of degree at least d.
में बचाया:
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
University of Zielona Góra
2016-05-01
|
| श्रृंखला: | Discussiones Mathematicae Graph Theory |
| विषय: | |
| ऑनलाइन पहुंच: | https://doi.org/10.7151/dmgt.1861 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|