On decomposing a graph into nontrivial bonds

DOI10.1002/1097-0118(200010)35:2%3C109::AID-JGT5%3E3.0.CO;2-8MaRDI QIDQ4518336zbMATH OpenOpenAlexFDO

Authors Sean McGuinness

Publication date 6 February 2001

Full work available at URL https://doi.org/10.1002/1097-0118(200010)35:2%3C109::aid-jgt5%3E3.0.co;2-8

zbMATH Keywords

\(K_5\)-minorbipartite graphbond decompositionbonds

Mathematics Subject Classification ID

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

Recommendations

• Contractible bonds in graphs
• Decompositions of a \(\lambda K_{m,n}\) into graphs of four vertices and five edges
• scientific article; zbMATH DE number 63789
• A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
• Decompositions of infinite graphs. I: Bond-faithful decompositions

Cites work

• Circuit decompositions of Eulerian graphs
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• Removable circuits in multigraphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four

Cited in

(3)

• Decomposition of multiport elements in a revised multibond graph notation
• Contractible bonds in graphs
• Non-isolating bondage in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518336)