Browsing by Subject "05B Designs and configurations"
Now showing items 1-3 of 3
(John Wiley and Sons, Inc., 1995)
Part of book or chapter of book
Restricted access - publisher's policyLet $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident ...
Open AccessThis paper deals with the question of completing a monotone increas- ing family of subsets G of a finite set ¿ to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ...
Restricted access - confidentiality agreementWe prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/ log n → c in probability, and EΔn ∼ c log n for a computable constant c > 0. The same kind of result holds for 2-connected ...