scientific article; zbMATH DE number 434896
From MaRDI portal
Publication:3139750
zbMATH Open0791.05037MaRDI QIDQ3139750FDOQ3139750
Authors: Zsolt Tuza, P. Erdős 
Publication date: 28 June 1994
Title of this publication is not available (Why is that?)
Recommendations
Cited In (23)
- On odd rainbow cycles in edge-colored graphs
- A rainbow about \(T\)-colorings for complete graphs
- On the approximability of the minimum rainbow subgraph problem and other related problems
- Color degree and heterochromatic cycles in edge-colored graphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- Better lower and upper bounds for the minimum rainbow subgraph problem
- Minimal colorings for properly colored subgraphs
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
- Minimum-degree conditions for rainbow triangles
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Color degree condition for long rainbow paths in edge-colored graphs
- Zeons, orthozeons, and graph colorings
- On the minimum monochromatic or multicolored subgraph partition problems
- Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
- Avoiding rainbow induced subgraphs in vertex-colorings
- Title not available (Why is that?)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Rainbow subgraphs in properly edge‐colored graphs
- Revisiting a randomized algorithm for the minimum rainbow subgraph problem
- A rainbow about T-colorings for complete graphs
- Problems on cycles and colorings
- Disjoint properly colored cycles in edge-colored complete bipartite graphs
- Balanced edge-colorings avoiding rainbow cliques of size four
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139750)
