Forbidden subgraphs and graph decomposition

DOI10.1002/net.3230170109zbMath0641.05047OpenAlexW2044314490MaRDI QIDQ3781793

Donald K. Wagner

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230170109

zbMATH Keywords

graph decompositionforbidden subgraphsAlgorithmic implications

Mathematics Subject Classification ID

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

Related Items (5)

Arborescence polytopes for series-parallel graphs ⋮ Exact counting of Euler tours for generalized series-parallel graphs ⋮ A Note on the Recognition of Nested Graphs ⋮ Balanced cycles and holes in bipartite graphs ⋮ The Steiner tree polytope and related polyhedra

Cites Work

• Determining when a graphic matroid is transversal in linear time
• A Combinatorial Decomposition Theory

This page was built for publication: Forbidden subgraphs and graph decomposition