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.
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
University of Zielona Góra
2016-05-01
|
| Edice: | Discussiones Mathematicae Graph Theory |
| Témata: | |
| On-line přístup: | https://doi.org/10.7151/dmgt.1861 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|