Vizing's conjecture for graphs with domination number 3 -- a new proof
The electronic journal of combinatorics, Tome 22 (2015) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Vizing's conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this note we use a new, transparent approach to prove Vizing's conjecture for graphs with domination number 3; that is, we prove that for any graph $G$ with $\gamma(G)=3$ and an arbitrary graph $H$, $\gamma(G\Box H) \ge 3\gamma(H)$.
DOI : 10.37236/5182
Classification : 05C69, 05C76
Mots-clés : Cartesian product, domination, Vizing's conjecture

Boštjan Brešar  1

1 University of Maribor, Faculty of Natural Sciences and Mathematics
@article{10_37236_5182,
     author = {Bo\v{s}tjan Bre\v{s}ar},
     title = {Vizing's conjecture for graphs with domination number 3 -- a new proof},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {3},
     doi = {10.37236/5182},
     zbl = {1323.05099},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5182/}
}
TY  - JOUR
AU  - Boštjan Brešar
TI  - Vizing's conjecture for graphs with domination number 3 -- a new proof
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5182/
DO  - 10.37236/5182
ID  - 10_37236_5182
ER  - 
%0 Journal Article
%A Boštjan Brešar
%T Vizing's conjecture for graphs with domination number 3 -- a new proof
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/5182/
%R 10.37236/5182
%F 10_37236_5182
Boštjan Brešar. Vizing's conjecture for graphs with domination number 3 -- a new proof. The electronic journal of combinatorics, Tome 22 (2015) no. 3. doi: 10.37236/5182

Cité par Sources :