On the problem of consistent marking of a graph (Q1805325)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the problem of consistent marking of a graph |
scientific article; zbMATH DE number 754009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the problem of consistent marking of a graph |
scientific article; zbMATH DE number 754009 |
Statements
On the problem of consistent marking of a graph (English)
0 references
11 May 1995
0 references
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.
0 references
consistent marking
0 references
marked graph
0 references
