A Criterion for Vertex Colorability of a Graph Stated in Terms of Edge Orientations

Simple item page
dc.creatorMatiyasevich, Yu. V.
dc.date2007-12-12
dc.date.accessioned2026-07-07T08:48:48Z
dc.date.available2026-07-07T08:48:48Z
dc.descriptionL.M.Vitaver [1962] and G.I.Minty [1962] suggested criteria for vertex colorability of a graph in at most a given number of colors; these criteria are stated in terms of the orientation of the edges. One additional criterion of this kind is given here.
dc.descriptionThis is author's translation of his paper originally published in Russian
dc.identifierhttps://arxiv.org/abs/0712.1884
dc.identifierhttp://arxiv.org/abs/0712.1884
dc.identifierDiskretnyi Analiz, issue 26, 65-71 (1974), Novosibirsk, Institute of Mathematics of Siberian Branch of Academy of Sciences of the USSR; http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:0298.05114&format=complete
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144076
dc.subjectCombinatorics
dc.subject05C15; 05C20
dc.titleA Criterion for Vertex Colorability of a Graph Stated in Terms of Edge Orientations
dc.typetext

Files

Collections

arXiv