Tree-width and circumference of graphs

DOI10.1002/jgt.10099zbMath1017.05036OpenAlexW4233868378WikidataQ130554490 ScholiaQ130554490MaRDI QIDQ4808403

Etienne Birmelé

Publication date: 22 May 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10099

zbMATH Keywords

circumferencetree-width

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (9)

Boxicity and treewidth ⋮ A tight Erdős-Pósa function for long cycles ⋮ On the Colin de Verdière number of graphs ⋮ Pathwidth vs Cocircumference ⋮ Tree-width of graphs without a \(3\times 3\) grid minor ⋮ Directed width parameters and circumference of digraphs ⋮ DAG-Width and Circumference of Digraphs ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Circumference and Pathwidth of Highly Connected Graphs

This page was built for publication: Tree-width and circumference of graphs