Zobrazeno 1 - 2
of 2
pro vyhledávání: '"05C70 (Primary) 05C85 (Secondary)"'
A linear forest is an acyclic graph whose each connected component is a path; or in other words, it is an acyclic graph whose maximum degree is at most 2. A linear coloring of a graph $G$ is an edge coloring of $G$ such that the edges in each color c
Externí odkaz:
http://arxiv.org/abs/2007.06066
Autor:
Levit, Vadim E., Mandrescu, Eugen
Let alpha(G) denote the maximum size of an independent set of vertices and mu(G) be the cardinality of a maximum matching in a graph G. A matching saturating all the vertices is perfect. If alpha(G) + mu(G) equals the number of vertices of G, then it
Externí odkaz:
http://arxiv.org/abs/1402.2903