Existence of rainbow matchings in strongly edge-colored graphs
DOI10.1016/J.DISC.2016.04.016zbMATH Open1339.05328OpenAlexW2396902672MaRDI QIDQ294535FDOQ294535
Authors: Guanghui Wang, Xiaowei Yu, Guiying Yan 
Publication date: 16 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.04.016
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- A lower bound for the length of a partial transversal in a Latin square
- Heterochromatic matchings in edge-colored graphs
- Large rainbow matchings in edge-coloured graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Rainbow matching in edge-colored graphs
- A bound on the strong chromatic index of a graph
- Large matchings in bipartite graphs have a rainbow matching
- On a Generalization of the Ryser-Brualdi-Stein Conjecture
- Problems and results in combinatorial analysis and graph theory
- Rainbow matchings in strongly edge-colored graphs
- Existences of rainbow matchings and rainbow matching covers
- Rainbow matchings and cycle-free partial transversals of Latin squares
- Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
- Rainbow matchings in properly edge colored graphs
- A note on large rainbow matchings in edge-coloured graphs
Cited In (4)
This page was built for publication: Existence of rainbow matchings in strongly edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294535)
