Forbidden subgraph decomposition

DOI10.1016/S0012-365X(01)00173-XzbMath0994.05122OpenAlexW2017867718MaRDI QIDQ1598796

Irena Rusu, Jeremy P. Spinrad

Publication date: 28 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00173-x

zbMATH Keywords

complexitybipartite graphgraph decomposition

Mathematics Subject Classification ID

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

Related Items (4)

\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Domination graphs: Examples and counterexamples ⋮ Matching cut in graphs with large minimum degree ⋮ The complexity of the matching-cut problem for planar graphs and other graph classes

This page was built for publication: Forbidden subgraph decomposition