scientific article; zbMATH DE number 3503285
From MaRDI portal
Publication:4083463
zbMath0322.05116MaRDI QIDQ4083463
No author found.
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (93)
Regarding two conjectures on clique and biclique partitions ⋮ Structured Codes of Graphs ⋮ Clique decompositions of multipartite graphs and completion of Latin squares ⋮ Decompositions of complete graphs into bipartite 2-regular subgraphs ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges ⋮ Decompositions of complete graphs into circulants ⋮ The number of edge-disjoint transitive triples in a tournament ⋮ Packing spanning graphs from separable families ⋮ Near perfect coverings in graphs and hypergraphs ⋮ Multicolor Turán numbers ⋮ On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ Fractional Triangle Decompositions in Graphs with Large Minimum Degree ⋮ Some new families of 3-regular self-complementary \(k\)-hypergraphs ⋮ The spectrum problem for digraphs of order 4 and size 5 ⋮ Unnamed Item ⋮ Euler tours in hypergraphs ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ On tight 6-cycle decompositions of complete 3-uniform hypergraphs ⋮ Covering the edges of a graph by a prescribed tree with minimum overlap ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ On asymptotic packing of convex geometric and ordered graphs ⋮ Unnamed Item ⋮ Balancing permuted copies of multigraphs and integer matrices ⋮ Q5‐factorization of λKn ⋮ A reduction of the spectrum problem for odd sun systems and the prime case ⋮ Graph and hypergraph packing ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Percentages in pairwise balanced designs ⋮ Edge decomposition of complete tripartite graphs ⋮ Brooks-type theorem for \(r\)-hued coloring of graphs ⋮ Completing partial packings of bipartite graphs ⋮ Problems and results in extremal combinatorics. I. ⋮ Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers ⋮ Fractional Clique Decompositions of Dense Partite Graphs ⋮ A survey on the existence ofG-Designs ⋮ On Tight Cycles in Hypergraphs ⋮ Unnamed Item ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ Decompositions of complete graphs into isomorphic cubes ⋮ More on decompositions of edge-colored complete graphs ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Intersecting designs ⋮ Decompositions of edge-colored complete graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Edge-decompositions of graphs with high minimum degree ⋮ A blow-up lemma for approximate decompositions ⋮ Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs ⋮ Balanced directed cycle designs based on groups ⋮ A proof of Ringel's conjecture ⋮ Saturated \(r\)-uniform hypergraphs ⋮ Packing the hypercube ⋮ A proof of the Barát-Thomassen conjecture ⋮ Pack graphs with subgraphs of size three ⋮ A subspace covering problem in the \(n\)-cube ⋮ A result on decompositions of regular graphs ⋮ Achromatic numbers and graph operations ⋮ Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes ⋮ Clumsy packings of graphs ⋮ Tight embeddings of partial quadrilateral packings ⋮ Decomposing dense bipartite graphs into 4-cycles ⋮ Multigraph decomposition into stars and into multistars ⋮ A finite embedding theorem for partial Steiner 3-designs ⋮ Complete colourings of hypergraphs ⋮ Resolvable group divisible designs with large groups ⋮ \(G\)-decomposition of \(K_n\), where G has four vertices or less ⋮ Long path and cycle decompositions of even hypercubes ⋮ Temporal cliques admit sparse spanners ⋮ \(G\)-designs and related designs ⋮ The combinatorics of N. G. de Bruijn ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Combinatorial designs and the theorem of Weil on multiplicative character sums ⋮ Covering graphs: The covering problem solved ⋮ Triple systems with no three triples spanning at most five points ⋮ Edge-decompositions of highly connected graphs into paths ⋮ Packing and decomposition of graphs with trees ⋮ On zero-sum spanning trees and zero-sum connectivity ⋮ Traffic grooming in bidirectional WDM ring networks ⋮ On asymptotic packing of geometric graphs ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions ⋮ Optimal partial clique edge covering guided by potential energy minimization ⋮ On colored designs. II ⋮ Resolvable BIBD and SOLS ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative ⋮ On the decomposition threshold of a given graph ⋮ Local and mean Ramsey numbers for trees ⋮ Least Common Multiple of a Cycle and a Star ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles ⋮ Local balance in graph decompositions ⋮ Decomposing oriented graphs into transitive tournaments
This page was built for publication:
