Strong branchwidth and local transversals

DOI10.1016/j.dam.2004.01.017zbMath1067.68109OpenAlexW2054312233MaRDI QIDQ1764812

Zsolt Tuza

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.01.017

zbMATH Keywords

treesclique numberchordal graphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Graph minors. X: Obstructions to tree-decomposition
• Treewidth. Computations and approximations
• A characterisation of rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Graph Classes: A Survey
• Graphs with Branchwidth at Most Three

This page was built for publication: Strong branchwidth and local transversals