Monotone drawings of planar graphs
暂无分享,去创建一个
We prove that there is a Steiner triple system 𝒯 such that every simple cubic graph can have its edges colored by points of 𝒯 in such a way that for each vertex the colors of the three incident edges form a triple in 𝒯. This result complements the result of Holroyd and Skoviera that every bridgeless cubic graph admits a similar coloring by any Steiner triple system of order greater than 3. The Steiner triple system employed in our proof has order 381 and is probably not the smallest possible. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 1524, 2004
[1] Fred C. Holroyd,et al. Colouring of cubic graphs by Steiner triple systems , 2004, J. Comb. Theory, Ser. B.
[2] R. Duffin. Topology of series-parallel networks , 1965 .
[3] Richard M. Wilson,et al. Embeddings of Steiner triple systems , 1973, Discret. Math..