Graph decomposition of slim graphs

zbMath0937.05063MaRDI QIDQ1288512

Yair Caro, Raphael Yuster

Publication date: 4 June 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithmsgraph decompositionsgraphs of bounded treewidthslim graphsstable cutsets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Unnamed Item ⋮ Algorithms Solving the Matching Cut Problem ⋮ Algorithms solving the matching cut problem ⋮ Planarization and fragmentability of some classes of graphs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition

This page was built for publication: Graph decomposition of slim graphs