搜索结果: 1-7 共查到“组合数学 edge”相关记录7条 . 查询时间(0.031 秒)
Acyclic edge-coloring using entropy compression
Acyclic edge-coloring entropy compression Combinatorics
font style='font-size:12px;'>
2012/6/29
An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-co...
Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs
Combinatorics fault-tolerant analysis (n, k)-star graphs edge-connectivity h-super edge-connectivity
font style='font-size:12px;'>
2012/4/18
This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\leqslant k \leqslant n-1$ and $0\leqslant h \leqslant n-k$, and deter...
Acyclic edge coloring of sparse graphs
acyclic coloring average degree critical
font style='font-size:12px;'>
2012/2/29
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such tha...
Edge growth in graph powers
Edge growth graph powers
font style='font-size:12px;'>
2012/2/29
For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two vertices within distance r of each other in G. We give a lower bound for the number of edges in the rth p...
Edge-coloring series-parallel multigraphs
Edge-coloring series-parallel multigraphs Data Structures and Algorithms Combinatorics
font style='font-size:12px;'>
2011/10/9
Abstract: We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colore...
Edge-Removal and Non-Crossing Perfect Matchings
Edge-Removal Non-Crossing Matchings Combinatorics Probability
font style='font-size:12px;'>
2011/9/5
Abstract: We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing...
Edge ideals: algebraic and combinatorial properties
Edge ideal regularity associated prime sequentially Cohen-Macaulay
font style='font-size:12px;'>
2011/2/25
Let C be a clutter and let I(C) R be its edge ideal. This is a survey paper on
the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regulari...