TY - JOUR
T1 - (2)-pancyclic graphs
AU - Zamfirescu, Carol T.
PY - 2013/5
Y1 - 2013/5
N2 - We introduce the class of (2)-pancyclic graphs, which are simple undirected finite connected graphs of order n having exactly two cycles of length p for each p satisfying 3 <= p <= n, analyze their properties, and give several examples of such graphs, among which are the smallest. (C) 2012 Elsevier B.V. All rights reserved.
AB - We introduce the class of (2)-pancyclic graphs, which are simple undirected finite connected graphs of order n having exactly two cycles of length p for each p satisfying 3 <= p <= n, analyze their properties, and give several examples of such graphs, among which are the smallest. (C) 2012 Elsevier B.V. All rights reserved.
KW - Pancyclic graphs
UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=web_of_science_starterapi&SrcAuth=WosAPI&KeyUT=WOS:000317451700025&DestLinkType=FullRecord&DestApp=WOS_CPL
U2 - 10.1016/j.dam.2012.11.002
DO - 10.1016/j.dam.2012.11.002
M3 - Article
SN - 0166-218X
VL - 161
SP - 1128
EP - 1136
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 7-8
ER -