A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs

DOI10.21136/cmj.1996.127306zbMath0879.05063OpenAlexW2739395371MaRDI QIDQ4368813

No author found.

Publication date: 10 December 1997

Full work available at URL: https://eudml.org/doc/30320

zbMATH Keywords

decompositionsfactorsforbidden subgraph characterizationdecomposable graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (5)

Random packing by matroid bases and triangles ⋮ Random packing by \(\rho\)-connected \(\rho\)-regular graphs ⋮ Randomly \(P_k\)-decomposable graphs ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Random packings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Randomly decomposable graphs
• Random packings of graphs
• Randomly matchable graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

This page was built for publication: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs