Premium
Critical graphs for subpancyclicity of 3‐connected claw‐free graphs
Author(s) -
Gould Ronald J.,
Łuczak Tomasz,
Pfender Florian
Publication year - 2009
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/jgt.20402
Subject(s) - combinatorics , mathematics , claw , chordal graph , graph , discrete mathematics , mechanical engineering , engineering
Let ${\cal{F}}_{k}$ be the family of graphs G such that all sufficiently large k ‐connected claw‐free graphs which contain no induced copies of G are subpancyclic. We show that for every k ≥3 the family ${\cal{F}}_{1}k$ is infinite and make the first step toward the complete characterization of the family ${\cal{F}}_{3}$ . © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 263–278, 2009
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom