scientific article; zbMATH DE number 3308993
From MaRDI portal
Publication:5589874
zbMATH Open0194.25203MaRDI QIDQ5589874FDOQ5589874
Authors: V. G. Vizing
Publication date: 1963
Title of this publication is not available (Why is that?)
Cited In (54)
- On minimal directed strongly regular Cayley graphs over dihedral groups
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
- Kronecker product of tensors and hypergraphs: structure and dynamics
- Generalization of restrained triple connected outer perfect domination number for square of grid graphs
- Total colorings of certain classes of lexicographic product graphs
- Generalised Paley graphs with a product structure
- The \(k\)-independence number of graph products
- Graphs with a unique maximum independent set up to automorphisms
- The 2-domination number of cylindrical graphs
- \(\gamma\)-graphs of trees
- Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
- Direct product primality testing of graphs is GI-hard
- Leaky forcing: a new variation of zero forcing
- Total colorings-a survey
- On the strong metric dimension of Cartesian and direct products of graphs
- A prime factor theorem for bipartite graphs
- Direct product of automorphism groups of digraphs
- Vertex-transitive direct products of graphs
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
- Edge-transitive lexicographic and Cartesian products
- Critical cyclic patterns related to the domination number of the torus
- Arithmetical semirings
- Domination in digraphs
- A survey on packing colorings
- Asymmetric colorings of products of graphs and digraphs
- The semigroup of metric measure spaces and its infinitely divisible probability measures
- On distance-regular Cayley graphs of generalized dicyclic groups
- Cancellation properties of products of graphs
- On disjoint maximum and maximal independent sets in graphs and inverse independence number
- A Vizing-type result for semi-total domination
- An improved bound in Vizing's conjecture
- The outer-connected vertex edge domination number in Cartesian product graphs
- A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs
- The geometry of diagonal groups
- Total colorings of product graphs
- On Cartesian products having a minimum dominating set that is a box or a stairway
- Fast factorization of Cartesian products of (directed) hypergraphs
- Rainbow domination in graphs
- Distinguishing Cartesian products of countable graphs
- Dominating sequences in grid-like and toroidal graphs
- Palindromic products
- Remarks on odd colorings of graphs
- Coloring, location and domination of corona graphs
- Behzad-Vizing conjecture and Cartesian product graphs
- Domination-related parameters in rooted product graphs
- Disjoint dominating sets with a perfect matching
- Total coloring conjecture for certain classes of graphs
- Some improved inequalities related to Vizing's conjecture
- Cartesian products of directed graphs with loops
- Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- Modular decomposition of graphs and the distance preserving property
- Independence number of products of Kneser graphs
- The domination number of \(K_n^3\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589874)