Decomposition of an infinite complete graph into complete bipartite subgraphs

DOI10.21136/CPM.1984.108429zbMATH Open0545.05058OpenAlexW3048268610MaRDI QIDQ3335829FDOQ3335829

Authors: Bohdan Zelinka 

Publication date: 1984

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

Recommendations

• Decompositions of complete graphs into bipartite 2-regular subgraphs
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Decomposition of random graphs into complete bipartite graphs
• On the decomposition of K_n into complete m‐partite graphs
• Decomposition of complete graphs into isomorphic complete bipartite graphs

zbMATH Keywords

infinite graphcomplete bipartite graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cited In (5)

• Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Title not available (Why is that?)
• Factorizing the Rado graph and infinite complete graphs
• Title not available (Why is that?)

This page was built for publication: Decomposition of an infinite complete graph into complete bipartite subgraphs

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