Sharp bounds for decompositions of graphs into completer-partite subgraphs
From MaRDI portal
Publication:4879175
DOI<393::AID-JGT4>3.0.CO;2-K 10.1002/(SICI)1097-0118(199604)21:4<393::AID-JGT4>3.0.CO;2-KzbMath0856.05081OpenAlexW4235787092MaRDI QIDQ4879175
Kevin N. Vander Meulen, David A. Gregory
Publication date: 8 July 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199604)21:4<393::aid-jgt4>3.0.co;2-k
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Skew rank decompositions ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ More on the Bipartite Decomposition of Random Graphs ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ Eigenvalues and clique partitions of graphs ⋮ A linear programming formulation for the maximum complete multipartite subgraph problem
This page was built for publication: Sharp bounds for decompositions of graphs into completer-partite subgraphs