The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set
Authors:
- 24 May 2017
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 33 (4) , 869-883
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11301251, 11671186)
- Shandong Province (2014ZRB019GU)
This publication has 25 references indexed in Scilit:
- The smallest one-realization of a given set IVDiscrete Mathematics, 2015
- The Smallest One-Realization of a Given Set IIIGraphs and Combinatorics, 2013
- Color-bounded hypergraphs, V: host graphs and subdivisionsDiscussiones Mathematicae Graph Theory, 2011
- Color-bounded hypergraphs, IV: Stable colorings of hypertreesDiscrete Mathematics, 2010
- Color-bounded hypergraphs, I: General resultsDiscrete Mathematics, 2009
- Color-bounded hypergraphs, II: Interval hypergraphs and hypertreesDiscrete Mathematics, 2008
- Color-bounded hypergraphs, III: Model comparisonApplicable Analysis and Discrete Mathematics, 2007
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2Discrete Mathematics, 2006
- On a Generalized Anti-Ramsey ProblemCombinatorica, 2001
- Mixed interval hypergraphsDiscrete Applied Mathematics, 1997