Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path

Share/Save/Bookmark

Xiong, L. and Broersma, H.J. and Hoede, C. (2001) Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path. [Report]

open access
[img]
Preview
PDF
158kB
Abstract:
A graph is called {\sl subpancyclic} if it contains a cycle of length $l$ for each $l$ between 3 and the circumference of a graph. We show that if $G$ is a connected graph on $n\geq 146$ vertices such that $d(u)+d(v)+d(x)+d(y)>\frac{n+10}{2}$ for all four $u, v, x, y$ of a path $P=uvxy$ in $G, $ then its line graph is subpancyclic unless $G$ is isomorphic to an exceptional graph, and the result is best possible, even under the condition that $L(G)$ is hamiltonian.
Item Type:Report
Additional information:Imported from MEMORANDA
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65793
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page