The bigraph decomposition number of a graph

DOI10.21136/CPM.1988.118332MaRDI QIDQ3475292zbMATH OpenOpenAlexFDO

Authors Bohdan Zelinka

Publication date 1988

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

zbMATH Keywords

bigraph decomposition numberminimum number of edge-disjoint complete bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposition of product graphs into complete bipartite subgraphs
• scientific article; zbMATH DE number 3841905
• The six bidecomposable graphs
• On the decomposition of graphs into complete bipartite graphs
• On a product dimension of bipartite graphs

Cited in

(4)

• Decomposition of product graphs into complete bipartite subgraphs
• Bidegree of graph and degeneracy number
• The six bidecomposable graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: The bigraph decomposition number of a graph

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