摘要: Abstract The main purpose of this paper is to present a technique for obtaining constructions color-critical graphs. consists in reducing hypergraphs graphs, and the obtained generalize unify known constructions. It suggested that other classes graphs may be by similar technique.
elsevier.com
sci-hub.se 参考文章(12)
Dénes König, Theorie Der Endlichen Und Unendlichen Graphen ,(1965)
G. Dirac, The structure of k-chromatic graphs Fundamenta Mathematicae. ,vol. 40, pp. 42- 55 ,(1953) , 10.4064/FM-40-1-42-55
P. Erdös, A. Hajnal, B. Rothchild, On chromatic number of graphs and set systems Cambridge Summer School in Mathematical Logic. ,vol. 17, pp. 531- 538 ,(1973) , 10.1007/BFB0066788
Bjarne Toft, On separating sets of edges in contraction-critical graphs Mathematische Annalen. ,vol. 196, pp. 129- 147 ,(1972) , 10.1007/BF01419610
W. G. Brown, H. A. Jung, On odd circuits in chromatic graphs Acta Mathematica Hungarica. ,vol. 20, pp. 129- 134 ,(1969) , 10.1007/BF01894573
L. Lovász, On chromatic number of finite set-systems Acta Mathematica Hungarica. ,vol. 19, pp. 59- 67 ,(1968) , 10.1007/BF01894680
H. S. M. Coxeter, Self-dual configurations and regular graphs Bulletin of the American Mathematical Society. ,vol. 56, pp. 413- 455 ,(1950) , 10.1090/S0002-9904-1950-09407-5
S. K. Stein, $B$-sets and coloring problems Bulletin of the American Mathematical Society. ,vol. 76, pp. 805- 806 ,(1970) , 10.1090/S0002-9904-1970-12559-9
Stephen Hedetniemi, On classes of graphs defined by special cutsets of lines The Many Facets of Graph Theory. pp. 171- 189 ,(1969) , 10.1007/BFB0060115
H. L. Abbott, D. Hanson, On A Combinatorial Problem of Erdös Canadian Mathematical Bulletin. ,vol. 12, pp. 823- 829 ,(1969) , 10.4153/CMB-1969-107-X