On the minimum rainbow subgraph number of a graph

DOI10.26493/1855-3974.246.94DMaRDI QIDQ2925427zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Improved approximation bounds for the minimum rainbow subgraph problem
• Algorithmic approaches for the minimum rainbow subgraph problem
• Approximation algorithms for the minimum rainbow subgraph problem
• Better lower and upper bounds for the minimum rainbow subgraph problem
• On the approximability of the minimum rainbow subgraph problem and other related problems

Cited in

(9)

• On the approximability of the minimum rainbow subgraph problem and other related problems
• The parameterized complexity of the rainbow subgraph problem
• Improved approximation bounds for the minimum rainbow subgraph problem
• Algorithmic approaches for the minimum rainbow subgraph problem
• The parameterized complexity of the rainbow subgraph problem
• Rainbow induced subgraphs in proper vertex colorings
• On the approximability of the minimum rainbow subgraph problem and other related problems
• Revisiting a randomized algorithm for the minimum rainbow subgraph problem
• Approximation algorithms for the minimum rainbow subgraph problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925427)