On the Edge-Coloring Property for the Closure of the Complete Hypergraphs

DOI10.1016/S0167-5060(08)70331-5zbMath0393.05009OpenAlexW140121307MaRDI QIDQ4175571

Ellis L. Johnson

Publication date: 1978

Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70331-5

zbMATH Keywords

HypergraphLinear ProgrammingChromatic IndexEdge Coloring PropertyMethodds

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

On the edge-colouring problem for unions of complete uniform hypergraphs ⋮ Disjoint Spread Systems and Fault Location

This page was built for publication: On the Edge-Coloring Property for the Closure of the Complete Hypergraphs