Skip to search formSkip to main contentSkip to account menu

Vizing's conjecture

Known as: Vizing conjecture 
In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Dominating setEternal dominating setGraph theoryVadim G. Vizing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Two inequalities related to Vizing's conjecture
A well-known conjecture of Vizing is that $\gamma(G \square H) \ge \gamma(G)\gamma(H)$ for any pair of graphs $G, H$, where… 
2017
2017
Improving the known bound in Vizing's conjecture
2015
2015
Vizing's Conjecture for Almost All Pairs of Graphs
For any graph $G=(V,E)$, a subset $S\subseteq V$ $dominates$ $G$ if all vertices are contained in the closed neighborhood of $S… 
2011
2011
A brief, simple proof of Vizing's conjecture
For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of… 
2011
2011
On edge-group choosability of graphs
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line… 
1996
1996
Asymptotics of the total chromatic number for simple graphs
For simple graphs, the ratio of the total chromatic number to its linear analogue, the fractional total chromatic number, tends… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)