On the minimum rainbow subgraph number of a graph

DOI10.26493/1855-3974.246.94DzbMath1301.05136OpenAlexW1922019929WikidataQ129355062 ScholiaQ129355062MaRDI QIDQ2925427

Ingo Schiermeyer

Publication date: 22 October 2014

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.246.94d

zbMATH Keywords

edge colouringrainbow subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The Parameterized Complexity of the Rainbow Subgraph Problem ⋮ The parameterized complexity of the rainbow subgraph problem

This page was built for publication: On the minimum rainbow subgraph number of a graph