Premium
Cyclicity of graphs
Author(s) -
Hammack Richard
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199910)32:2<160::aid-jgt6>3.0.co;2-u
Subject(s) - combinatorics , chordal graph , mathematics , pathwidth , discrete mathematics , indifference graph , outerplanar graph , interval graph , block graph , split graph , treewidth , graph , 1 planar graph , line graph
The cyclicity of a graph is the largest integer n for which the graph is contractible to the cycle on n vertices. By analyzing the cycle space of a graph, we establish upper and lower bounds on cyclicity. These bounds facilitate the computation of cyclicity for several classes of graphs, including chordal graphs, complete n ‐partite graphs, n ‐cubes, products of trees and cycles, and planar graphs. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 160–170, 1999