Publication:4222172
From MaRDI portal
DOI<1::AID-JCD1>3.0.CO;2-J 10.1002/(SICI)1520-6610(1998)6:1<1::AID-JCD1>3.0.CO;2-JzbMath0917.05061MaRDI QIDQ4222172
Hung-Lin Fu, David E. Woolbright
Publication date: 6 December 1998
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
How many colors guarantee a rainbow matching?, Maximum transversal in partial Latin squares and rainbow matchings, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Minimum number of palettes in edge colorings, Maximum weight edge-constrained matchings, A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph, Rainbow faces in edge‐colored plane graphs