On the problem of consistent marking of a graph (Q1805325): Difference between revisions

A marked graph is called consistent if every cycle has an even number of vertices marked with the sign ``--''. The author reduces the problem of characterizing graphs that can be consistently marked to blocks and proves a necessary and sufficient condition for a block \(G\) with no cycle of length greater than 5 to be markable.