搜索结果: 1-4 共查到“组合数学 bound”相关记录4条 . 查询时间(0.046 秒)
A sharp upper bound for the rainbow 2-connection number of 2-connected graphs
rainbow edge-coloring rainbow k-connection number 2-connected graph ear decomposition
2012/4/18
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-c...
A Wowzer Type Lower Bound for the Strong Regularity Lemma
Wowzer Type Lower Bound Regularity Lemma
2011/9/20
Abstract: The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a st...
Abstract: Every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$. The result is sharp.
A Combined Logarithmic Bound on the Chromatic Index of a Multigraph
Combined Logarithmic Bound Chromatic Index of Multigraph
2011/2/25
For a multigraph G, the integer round-up (G) of the fractional chromatic index f (G) yields a good general lower bound for the chromatic index „ (G). For an upper bound,...