Odd neighborhood transversals on grid graphs-Reference-Cited by-同舟云学术

Odd neighborhood transversals on grid graphs

Published:2007-08 Issue:17-18 Volume:307 Page:2200-2208
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Cowen Robert,Hechler Stephen H.,Kennedy John W.,Steinberg Arthur

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference6 articles.

1. Simple proofs to three parity theorems;Caro;Ars. Combin.,1966

2. Inversion and neighborhood inversion in graphs;Cowen;Graph Theory Notes New York,1999

3. Y. Dodis, P. Winkler, Universal configurations in light-flipping games, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 926–927.

4. J. Goldwasser, W. Klostermeyer, Odd and even dominating sets with open neighborhoods, Ars. Combin., to appear.

5. J. Goldwasser, W. Klostermeyer, Total perfect codes in grid graphs, Bull. ICA, 46 (2006) 61–68.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimal Non-Odd-Transversal Hypergraphs and Minimal Non-Odd-Bipartite Hypergraphs;The Electronic Journal of Combinatorics;2020-11-27

2. Efficient Open Domination in Digraph Products;Mathematics;2020-04-02

3. Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue;Linear Algebra and its Applications;2019-10

4. Total Roman domination in the lexicographic product of graphs;Discrete Applied Mathematics;2019-06

5. Efficient closed domination in digraph products;Journal of Combinatorial Optimization;2019-01-01