A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2. For a given graph H we say that G is H-f1-heavy if for every induced subgraph K of G isomo...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
University of Zielona Góra
2017-05-01
|
| Sarja: | Discussiones Mathematicae Graph Theory |
| Aiheet: | |
| Linkit: | https://doi.org/10.7151/dmgt.1938 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|