Premium
Tree‐width and circumference of graphs
Author(s) -
Birmele Etienne
Publication year - 2003
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.10099
Subject(s) - circumference , combinatorics , mathematics , graph , tree (set theory) , upper and lower bounds , discrete mathematics , geometry , mathematical analysis
We prove that every graph of circumference k has tree‐width at most k − 1 and that this bound is best possible. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 24–25, 2003
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