The Treewidth and Pathwidth of Graph Unions

DOI10.1137/22m1524047arXiv2202.07752MaRDI QIDQ6141861

Bogdan Alecu, Vadim V. Lozin, Victor Zamaraev, Daniel A. Quiroz, Igor Razgon, Roman Rabinovich

Publication date: 23 January 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.07752

zbMATH Keywords

treewidth, pathwidth, graph union, gluing of graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. I. Excluding a forest
• The vertex separation number of a graph equals its path-width
• Well-quasi-ordering versus clique-width
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Caterpillar arboricity of planar graphs
• On the Ordered Conjecture
• On the Relationship Between Clique-Width and Treewidth
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Decomposition of Finite Graphs Into Forests
• The planar tree packing theorem

This page was built for publication: The Treewidth and Pathwidth of Graph Unions