Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o
โฆ LIBER โฆ
Some counterexamples associated with the three-color problem
โ Scribed by V.A Aksionov; L.S Mel'nikov
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 599 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Some undecidable problems involving the
โ
Stefan A. Burr
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 477 KB
Some statistical problems in connection
โ
Frank A. Haight
๐
Article
๐
1966
๐
Elsevier Science
๐
English
โ 738 KB
Some advances in the no-three-in-line pr
โ
R.R Hall; T.H Jackson; A Sudbery; K Wild
๐
Article
๐
1975
๐
Elsevier Science
๐
English
โ 302 KB
Boundary knot method for some inverse pr
โ
Bangti Jin; Yao Zheng
๐
Article
๐
2005
๐
John Wiley and Sons
๐
English
โ 222 KB
The boundary knot method is an inherently meshless, integration-free, boundary-type, radial basis function collocation technique for the solution of partial differential equations. In this paper, the method is applied to the solution of some inverse problems for the Helmholtz equation, including the
Some combinatorial problems associated w
โ
D.M Jackson
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 342 KB
Some problems associated with large scal
โ
D. Grogan; R.P. Bradley; J.P. Ashmore; J.G. Scott
๐
Article
๐
1980
๐
Elsevier Science
โ 142 KB