Forbidden subgraphs and graph decomposition
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Balanced cycles and holes in bipartite graphs
- The Steiner tree polytope and related polyhedra
- Arborescence polytopes for series-parallel graphs
- Forbidden subgraph decomposition
- Forbidden subgraphs for \(k\) vertex-disjoint stars
- Forbidden subgraphs and weak locally connected graphs
- Line graphs and forbidden induced subgraphs
- Degree powers in graphs with forbidden subgraphs
- Forbidden subgraphs and the König-Egerváry property
- scientific article; zbMATH DE number 4170928 (Why is no real title available?)
- A note on the recognition of nested graphs
- scientific article; zbMATH DE number 4101231 (Why is no real title available?)
- scientific article; zbMATH DE number 1185308 (Why is no real title available?)
- Exact counting of Euler tours for generalized series-parallel graphs
- scientific article; zbMATH DE number 734480 (Why is no real title available?)
- scientific article; zbMATH DE number 2076929 (Why is no real title available?)
- Forbidden Induced Subgraphs for Toughness
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
This page was built for publication: Forbidden subgraphs and graph decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3781793)