Search for Author All Reviews
	KotrbčIk, Michal     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       A note on disjoint cycles Kotrbčík M. Information Processing Letters 112(4): 135-137, 2012.  Type: Article Certain measures of graphs, such as the edge coloring number, are hard to compute precisely. Some others, such as the maximum number of vertex-disjoint cycles, are even hard to approximate. It is known, for example, that computing &...... May 17 2012
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy