On perfection and imperfection of one-realizations of a given set
DOI10.1016/j.disc.2016.03.024zbMath1339.05127OpenAlexW2399274752MaRDI QIDQ294527
Ping Zhao, Kefeng Diao, Bing Xue, Vitaly I. Voloshin
Publication date: 16 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.03.024
embeddingchromatic spectrum\(\mathcal{C}\)-perfection\(\mathcal{C}\)-stable setsmixed hypergraph coloringone-realization
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- The chromatic spectrum of 3-uniform bi-hypergraphs
- The smallest one-realization of a given set
- The smallest one-realization of a given set. II.
- The smallest one-realization of a given set. III
- Mixed hypergraphs and other coloring problems
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
- Color-bounded hypergraphs. I: General results
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Mixed interval hypergraphs
- Colouring planar mixed hypergraphs
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- On feasible sets of mixed hypergraphs
- Uncolorable mixed hypergraphs
- Pattern hypergraphs
- Uniform mixed hypergraphs: the possible numbers of colors
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- The smallest one-realization of a given set. IV
- On the price of equivocation in byzantine agreement
- C-perfect hypergraphs
- Color-bounded hypergraphs, V: host graphs and subdivisions
This page was built for publication: On perfection and imperfection of one-realizations of a given set
