Coloring Properties of Mixed Cycloids
暂无分享,去创建一个
Zsolt Tuza | Vitaly I. Voloshin | György Dósa | Nicholas Newman | Z. Tuza | V. Voloshin | G. Dósa | N. Newman
[1] V. Voloshin. Coloring mixed hypergraphs : theory, algorithms and applications , 2002 .
[2] Vitaly Voloshin,et al. Colorings of (r, r)-Uniform, Complete, Circular, Mixed Hypergraphs , 2021 .
[3] H. Voss,et al. ABOUT PERFECTION OF CIRCULAR MIXED HYPERGRAPHS , 2021 .
[4] Csilla Bujtás,et al. Maximum number of colors: C-coloring and related problems , 2011 .
[5] Artur M. Schweidtmann,et al. Modelling Circular Structures in Reaction Networks: Petri Nets and Reaction Network Flux Analysis , 2020 .
[6] V. Voloshin,et al. Circular Mixed Hypergraphs I Colorability and Unique Colorability , 2013 .
[7] Vitaly I. Voloshin,et al. Mixed Interval Hypergraphs , 1997, Discret. Appl. Math..
[8] Vitaly I. Voloshin,et al. The mixed hypergraphs , 1993, Comput. Sci. J. Moldova.
[9] Zsolt Tuza,et al. Uncolorable Mixed Hypergraphs , 2000, Discret. Appl. Math..
[10] Csilla Bujtás,et al. Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees , 2009, Discret. Math..
[11] Daniel Král,et al. Mixed hypercacti , 2004, Discret. Math..
[12] Csilla Bujtás,et al. C-perfect hypergraphs , 2010, J. Graph Theory.
[13] Csilla Bujtás,et al. Voloshin's conjecture for C-perfect hypertrees , 2010, Australas. J Comb..
[14] Vitaly I. Voloshin,et al. Circular mixed hypergraphs II: The upper chromatic number , 2006, Discret. Appl. Math..
[15] Vitaly I. Voloshin,et al. On the upper chromatic number of a hypergraph , 1995, Australas. J Comb..
[16] Zsolt Tuza,et al. The Chromatic Spectrum of Mixed Hypergraphs , 2002, Graphs Comb..