Dec 28, 2008 · We consider various properties of a general parity domination problem: given a graph G on n vertices, one is looking for a subset S of the ...
Mar 23, 2007 · We consider various properties of a general parity domination problem: given a graph G, one is looking for a subset S of the vertex set such ...
[PDF] Combinatorial properties of a general domination problem ... - CORE
core.ac.uk › download › pdf
We consider various properties of a general parity domination problem: given a graph G on n vertices, one is looking for a.
We consider various properties of a general parity domination problem: given a graph G on n vertices, one is looking for a subset S of the vertex set such ...
We consider various properties of a general parity domination problem: given a graph G on n vertices, one is looking for a subset S of the vertex set such ...
Hatzl J, Wagner S. Combinatorial properties of a general domination problem with parity constraints. 2007. Poster session presented at C&O@40 Conference, ...
Combinatorial properties of a general domination problem with parity constraints. J Hatzl, S Wagner. Discrete mathematics 308 (24), 6355-6367, 2008. 4, 2008.
Combinatorial properties of a general domination problem with parity constraints Original Research Article. Author/Authors : Johannes Hatzl، نويسنده ...
Combinatorial properties of a general domination problem with parity constraints · J. HatzlS. Wagner. Mathematics. Discrete Mathematics. 2008. 4 Citations · PDF.
Hatzl J, Wagner S (2008) Combinatorial properties of a general domination problem with parity constraints. Discret Math (2008). Crossref · Google Scholar. [17].