Tree-width and circumference of graphs
From MaRDI portal
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
(19)- Treewidth of the generalized Kneser graphs
- A tight Erdős-Pósa function for long cycles
- Boxicity and treewidth
- DAG-width and circumference of digraphs
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number
- Treewidth and pathwidth parameterized by the vertex cover number
- The Branch-Width of Circular-Arc Graphs
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- Treewidth and Pathwidth of Permutation Graphs
- The impact of locality in the broadcast congested clique model
- Circumference and pathwidth of highly connected graphs
- Pathwidth vs Cocircumference
- On the Colin de Verdière number of graphs
- On the treewidth of Hanoi graphs
- Linear bounds on treewidth in terms of excluded planar minors
- Fragile minor-monotone parameters under a random edge perturbation
- Directed width parameters and circumference of digraphs
- Defective and clustered colouring of graphs with given girth
- Tree-width of graphs without a \(3\times 3\) grid minor
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)
