Rainbow edge-coloring and rainbow domination

DOI10.1016/J.DISC.2012.03.014zbMath1277.05064OpenAlexW1974728426MaRDI QIDQ383777

Douglas B. West, Timothy D. LeSaulnier

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.014

zbMATH Keywords

coronarainbow dominationrainbow matchingArnautov-Payan boundrainbow edge-coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees ⋮ Existences of rainbow matchings and rainbow matching covers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow matching in edge-colored graphs
• Heterochromatic matchings in edge-colored graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• On graphs having domination number half their order
• On the ratio of optimal integral and fractional covers
• Transversal numbers of uniform hypergraphs
• Large Rainbow Matchings in Edge-Coloured Graphs
• High degree graphs contain large-star factors
• Domination-balanced graphs

This page was built for publication: Rainbow edge-coloring and rainbow domination