Tree-width and circumference of graphs
From MaRDI portal
Publication:4808403
DOI10.1002/JGT.10099zbMATH Open1017.05036OpenAlexW4233868378WikidataQ130554490 ScholiaQ130554490MaRDI QIDQ4808403FDOQ4808403
Authors: 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
Recommendations
- TREEWIDTH OF CIRCLE GRAPHS
- scientific article; zbMATH DE number 772777
- Treewidth of Circular-Arc Graphs
- Tree-Related Widths of Graphs and Hypergraphs
- On the tree-width of planar graphs
- The treewidth of line graphs
- Tree width and regular triangulations
- Tree-Width and Optimization in Bounded Degree Graphs
- On graphoidal length of a tree in terms of its diameter
- Treewidth for graphs with small chordality
Cited In (16)
- Title not available (Why is that?)
- The Branch-Width of Circular-Arc Graphs
- DAG-width and circumference of digraphs
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number
- Treewidth and Pathwidth of Permutation Graphs
- Tree-width of graphs without a \(3\times 3\) grid minor
- Directed width parameters and circumference of digraphs
- Treewidth of the generalized Kneser graphs
- Pathwidth vs Cocircumference
- The impact of locality in the broadcast congested clique model
- Circumference and pathwidth of highly connected graphs
- Treewidth and pathwidth parameterized by the vertex cover number
- Boxicity and treewidth
- On the treewidth of Hanoi graphs
- A tight Erdős-Pósa function for long cycles
- On the Colin de Verdière number of graphs
This page was built for publication: Tree-width and circumference of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808403)
