On (k, d)-colorings and fractional nowhere-zero flows
نویسندگان
چکیده
The concepts of (k, d)-coloring and the star chromatic number, studied by Vince, by Bondy and Hell, and by Zhu are shown to reflect the cographic instance of a wider concept, that of fractional nowhere-zero flows in regular matroids. c © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 155–161, 1998
منابع مشابه
On ( k ; d ) - Colorings and Fractional Nowhere
The concepts of (k; d)-coloring and the star chromatic number, studied by Vince, by Bondy and Hell, and by Zhu are shown to reeect the cographic instance of a wider concept, that of fractional nowhere-zero ows in regular matroids.
متن کاملGroup Connectivity and Group Colorings of Graphs — A Survey
In 1950s, Tutte introduced the theory of nowhere-zero flows as a tool to investigate the coloring problem of maps, together with his most fascinating conjectures on nowhere-zero flows. These have been extended by Jaeger et al. in 1992 to group connectivity, the nonhomogeneous form of nowhere-zero flows. Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and A∗ = A − ...
متن کاملEnumerating colorings, tensions and flows in cell complexes
We study quasipolynomials enumerating proper colorings, nowherezero tensions, and nowhere-zero flows in an arbitrary CW-complex X, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may be either modular (with values in Z/kZ for some k) or integral (with values in {−k + 1, . . . , k − 1}). We obtain deletion-contraction recurrences and closed ...
متن کاملNowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares
It is proved in this paper that every bipartite graphic sequence with the minimum degree δ ≥ 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture originally proposed by Keedwell (1993) and reproposed by Cameron (1999) about simultaneous edgecolorings and critical partial Latin squares. ∗Mathematics Subject Classification (2000): 05C15, 05B15, 05C38, 05C70, 05C07.
متن کاملInside-Out Polytopes
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an integer whose parts are partially distinct, and generalized latin squares. Our method is to generalize Ehrhart’s theory of lattice-point counting to a convex pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 28 شماره
صفحات -
تاریخ انتشار 1998