On decomposing a graph into nontrivial bonds

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200010)35:2<109::AID-JGT5>3.0.CO;2-8" /><109::AID-JGT5>3.0.CO;2-8 10.1002/1097-0118(200010)35:2<109::AID-JGT5>3.0.CO;2-8zbMath0967.05053OpenAlexW4251611257MaRDI QIDQ4518336

Sean McGuinness

Publication date: 6 February 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200010)35:2<109::aid-jgt5>3.0.co;2-8

zbMATH Keywords

bipartite graphbonds\(K_5\)-minorbond decomposition

Mathematics Subject Classification ID

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

Related Items (1)

Contractible bonds in graphs

Cites Work

• Removable circuits in multigraphs
• Circuit decompositions of Eulerian graphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• Unnamed Item

This page was built for publication: On decomposing a graph into nontrivial bonds