scientific article; zbMATH DE number 1229733
From MaRDI portal
Publication:4222172
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
David E. Woolbright, Hung-Lin Fu
Publication date: 6 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
Maximum transversal in partial Latin squares and rainbow matchings ⋮ How many colors guarantee a rainbow matching? ⋮ Maximum weight edge-constrained matchings ⋮ Minimum number of palettes in edge colorings ⋮ A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Transversals in generalized Latin squares ⋮ Rainbow faces in edge‐colored plane graphs
This page was built for publication:
