๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A reduction of propositional tautologihood to the coloring of graphs in three colors

โœ Scribed by G. V. Davydov; P. Yu. Suvorov


Publisher
Springer US
Year
1977
Tongue
English
Weight
287 KB
Volume
8
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The color space of a graph
โœ Tommy R. Jensen; Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 191 KB ๐Ÿ‘ 1 views
A generalization of edge-coloring in gra
โœ S. Louis Hakimi; Oded Kariv ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all

Coloring the square of a planar graph
โœ Jan van den Heuvel; Sean McGuinness ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 2 views

## Abstract We prove that for any planar graph __G__ with maximum degree ฮ”, it holds that the chromatic number of the square of __G__ satisfies ฯ‡(__G__^2^)โ€‰โ‰คโ€‰2ฮ”โ€‰+โ€‰25. We generalize this result to integer labelings of planar graphs involving constraints on distances one and two in the graph. ยฉ 2002

A property of the colored complete graph
โœ J. Shearer ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 433 KB

If the lines of the complete graph K,, are calmed so that no point is on more than +(n -1) lines of the same color or so that each point lies on more than $(5n + 8) lines of different colors, then K,, contains a cycle of length n with adjacent lines having different colors. Let the lines of a graph

Coloring the Edges of a Complete Graph
โœ Annamaria G. Varga ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 577 KB