A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K), dK(u, v) = 2 implies min{dG(u),dG(v)}≥n+1...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2016-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1840 |