scientific article; zbMATH DE number 524129

MaRDI QIDQ4284618zbMATH OpenFDO

Authors Torsten B. Hellgren, Roland Häggkvist

Publication date 24 March 1994

zbMATH Keywords

Baranyai's theorembipartite graphcoloringshypergraphsKönig's theoremRyser's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Extending edge-colorings of complete hypergraphs into regular colorings
• Extending regular edge-colorings of complete hypergraphs
• On almost-regular edge colourings of hypergraphs
• Covering complete partite hypergraphs by monochromatic components
• Generalizations and strengthenings of Ryser's conjecture

Cited in

(15)

• Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes
• On regular set systems containing regular subsystems
• Avoiding and extending partial edge colorings of hypercubes
• Embedding connected factorizations
• Restricted extension of sparse partial edge colorings of hypercubes
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
• Extending edge-colorings of complete hypergraphs into regular colorings
• The edge coloring number of generalized complete r-partitioned hypergraph
• Maximally edge-connected hypergraphs
• scientific article; zbMATH DE number 7640248 (Why is no real title available?)
• Extending regular edge-colorings of complete hypergraphs
• Toward a three-dimensional counterpart of Cruse's theorem
• Embedding connected factorizations. II
• On almost-regular edge colourings of hypergraphs

This page was built for publication:

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