Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

95

EJC
2007

153views Information Technology» more EJC 2007»

Colorful subgraphs in Kneser-like graphs

15 years 3 months ago

Colorful subgraphs in Kneser-like graphs

Download www.renyi.hu

Gábor Simonyi, Gábor Tardos

Real-time Traffic

EJC 2007 | Information Technology |

claim paper

Related Content

» Extended core and choosability of a graph

» Multiagent Graph Coloring Pareto Efficiency Fairness and Individual Rationality

» Improved Inapproximability Results for Maximum kColorable Subgraph

» A characterization of bperfect graphs

» Planar Graph Coloring Avoiding Monochromatic Subgraphs Trees and Paths Make It Difficult

» Colored graphs without colorful cycles

» Coloring Subgraphs of the Rado Graph

» Local 7coloring for planar subgraphs of unit disk graphs

» Convergent transfer subgraph characterization and computation

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	EJC
Authors	Gábor Simonyi, Gábor Tardos

Comments (0)